Download:
|
by Richard Beigel, M+)-tt P
http://1013seopc.eecs.uic.edu/papers/btt-ccc.ps.gz
Add To MetaCart
Abstract:
Prior results show that most bounded query hierarchies cannot contain finite gaps. For example, it is known that P
Citations
|
535
|
Theory of Recursive Functions and Effective Computability
– Rogers
- 1967
|
|
365
|
Recursively Enumerable Sets and Degrees
– Soare
- 1987
|
|
190
|
The complexity of optimization problems
– Krentel
- 1988
|
|
146
|
On the computational complexity of algorithms
– Hartmanis, Stearns
- 1965
|
|
117
|
A machine-independent theory of the complexity of recursive functions
– Blum
- 1967
|
|
111
|
The complexity of combinatorial problems with succinct input representations
– Wagner
- 1986
|
|
78
|
The Boolean hierarchy I: Structural properties
– Cai, Gundermann, et al.
- 1988
|
|
70
|
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
– Kadin
- 1988
|
|
61
|
More complicated questions about maxima and minima, and some closures of NP
– Wagner
- 1987
|
|
49
|
Query-Limited Reducibilities
– Beigel
- 1987
|
|
42
|
Terse, superterse, and verbose sets
– Beigel, Gasarch, et al.
- 1993
|
|
30
|
Refining nondeterminism in relativized polynomial-time bounded computations
– Kintala, Fischer
- 1980
|
|
23
|
On bounded queries and approximation
– Chang, Gasarch, et al.
- 1997
|
|
23
|
Generalizations of optp to the polynomial hierarchy
– Krentel
- 1992
|
|
19
|
Downward separation fails catastrophically for limited nondeterminism classes
– Beigel, Goldsmith
- 1994
|
|
11
|
OptP-completeness as the normal behavior of NP-complete problems
– Gasarch, Krentel, et al.
- 1995
|
|
4
|
On bounded queries to arbitrary sets
– Lozano
- 1991
|
