Download:
|
by Richard Beigel
Journal of Computer and System Sciences
http://1013seopc.eecs.uic.edu/papers/mods-relativized-jcss.PS.gz
Add To MetaCart
Abstract:
Well known complexity classes such as NP, co-NP, \PhiP (PARITY-P), and PP are produced by considering a nondeterministic polynomial time Turing machine N and defining acceptance in terms of the number of accepting paths in N. That is, they are subclasses of P #P[1]. Other interesting classes such as MOD k P and C=P are also subclasses of P #P[1]. Many relations among these classes are unresolved. Of course, these classes coincide if P = PSPACE. However, we develop a simple combinatorial technique for constructing oracles that separate counting classes. Our results suggest that it will be difficult to resolve the unknown relationships among different counting classes. In addition to presenting new oracle separations, we simplify several previous constructions.
Citations
|
324
|
The complexity of computing the permanent
– Valiant
- 1979
|
|
239
|
Algebraic methods in the theory of lower bounds for boolean circuit complexity. 19th STOC
– Smolensky
- 1987
|
|
226
|
The polynomial-time hierarchy
– Stockmeyer
- 1977
|
|
209
|
Computational complexity of probabilistic Turing machines
– Gill
- 1977
|
|
192
|
Almost optimal lower bounds for small depth circuits
– HËšastad
- 1986
|
|
157
|
Separating the polynomial-time hierarchy by oracles
– Yao
- 1985
|
|
128
|
The equivalence problem for regular expressions with squaring requires exponential space
– Meyer, Stockmeyer
- 1972
|
|
111
|
The complexity of combinatorial problems with succinct input representations
– Wagner
- 1986
|
|
64
|
Counting classes: thresholds, parity, mods, and fewness
– Beigel, Gill
- 1992
|
|
60
|
Relative to a random oracle A, P A 6= NP A 6= Co-NP A with probability 1
– Bennett, Gill
- 1981
|
|
46
|
Complexity classes without machines: On complete languages for UP
– Hartmanis, Hemachandra
- 1988
|
|
43
|
On the construction of parallel computers from various bases of boolean functions
– Goldschlager, Parberry
- 1986
|
|
42
|
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
– Cai
- 1989
|
|
40
|
On the unique satisfiability problem
– Blass, Gurevich
- 1982
|
|
38
|
On the computational power of PP and
– Toda
- 1989
|
|
26
|
On relativization and the existence of complete sets
– Sipser
- 1982
|
|
21
|
Structural Properties of The Counting Hierarchies
– Tor'an
- 1988
|
|
18
|
An oracle characterization of the counting hierarchy
– Tor'an
- 1988
|
|
16
|
Classes of bounded nondeterminism
– D'iaz, Tor'an
- 1990
|
|
11
|
On the relativized power of additional accepting paths
– Beigel
- 1989
|
|
11
|
Structural Properties of Complexity Classes
– Russo
- 1985
|
|
6
|
Two remarks on the complexity of counting
– Papadimitriou, Zachos
- 1983
|
|
5
|
On the power of probabilistic polynomial time: P NP[log] ` PP
– Hemachandra, Wechsung
- 1989
|
|
5
|
On complete problems for NP " co-NP
– Hartmanis, Immerman
- 1985
|
|
4
|
On the power of parity polynomial time. Mathematical Systems Theory
– Cai, Hemachandra
- 1990
|
|
3
|
Expanded Edition
– Perceptrons
- 1988
|
