How reductions to sparse sets collapse the polynomial time hierarchy: a primer. Part I:Polynomial-time Turing reductions

Authors
Young
Citation
Young, How reductions to sparse sets collapse the polynomial time hierarchy: a primer. Part I:Polynomial-time Turing reductions, SIGACT news , 23(3), 1992, pp. 107-117
Journal title
SIGACT news → ACNP
ISSN journal
01635700
Volume
23
Issue
3
Year of publication
1992
Pages
107 - 117
Database
ACNP
SICI code