On the Power of Parity Polynomial Time

@inproceedings{Cai1989OnTP,
  title={On the Power of Parity Polynomial Time},
  author={Jin-Yi Cai and Lane A. Hemaspaandra},
  booktitle={STACS},
  year={1989}
}
This paper proves that the complexity class ⊕P, parity polynomial time [PZ83], contains the class of languages accepted by NP machines with few accepting paths. Indeed, ⊕P contains a broad class of languages accepted by path-restricted nondeterministic machines. 
On the power of parity polynomial time
TLDR
It is proved that the complexity class ⊕P, parity polynomial time [PZ], contains the class of languages accepted byNP machines with few accepting paths, and that theclass of nondeterministic path-restricted languages is closed under bounded truth-table reductions. Expand
Probabilistic Polynomial Time is Closed under Parity Reductions
TLDR
It is shown that probabilistic polynomial time (PP) is closed underPolynomial-time parity reductions and that several complexity classes are contained in PP. Expand
Complexity Classes with Complete Problems Between P and NP-C
TLDR
It is observed that language classes located between P and NP have complete problems, and characterizations of these classes are found using robust machines with bounded access to the oracle, and in terms of nondeterministic complexity classes with polylog running time. Expand
Counting Classes: Thresholds, Parity, Mods, and Fewness
TLDR
Every counting class consists of languages in P#P, the class of languages computable in polynomial time using a single call to an oracle capable of determining the number of accepting paths of an NP machine. Expand
The BP-Operator and the Power of Counting Classes
With the help of the BP· operator, Toda (1989) achieved an astonishing result: the classes ⊕P and #P are, in a sense, at least as expressive as the entire polynomial hierarchy.
Polynomial Time Machines Equipped with Word Problems over Algebraic Structures as their Acceptance Criteria
TLDR
This work investigates the power of polynomial time machines whose acceptance mechanism is defined by a word problem over some finite semigroup, monoid, or group and shows that the according complexity class is PSPACE. Expand
Classes of bounded nondeterminism
TLDR
It is observed that these classes have complete problems and a characterization of the classes using robust machines with bounded access to the oracle is found, obtaining some other results in this direction. Expand
Polynomial-Time Functions Generate SAT: On P-Splinters
TLDR
It is shown that there is a polynomial-time computable function f and an initial element x0 such that SAT = f(x_0), f(f( x_0 )), ...} \right\}. Expand
A survey on counting classes
TLDR
The authors prove P/sup EP(log)/ 25 PP, investigate the Boolean closure BC( EP) of EP, and give a relativization principle which allows them to completely separate BC(EP) in a suitable relativized world and to give simple proofs for known relativizing results. Expand
Polynomial Time Samplable Distributions
TLDR
Those distributions which can be sampled by randomized algorithms in time polynomial in the length of their outputs are shown to be exactly as hard as #P-functions to compute deterministically and at least ashard as NP-sets to approximate by deterministic protocols. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
On the Power of Probabilistic Polynomial Time:PNP[log] ⊆ PP
We show that every set in the 0~ level of the polynomial hierarchy-every set polynomial­ time truth-table reducible to SAT~is accepted by a probabilistic polynomial-time Turing machine: pNP[log] ~Expand
Two remarks on the power of counting
The relationship between the polynomial hierarchy and Valiant's class #P is at present unknown. We show that some low portions of the polynomial hierarchy, namely deterministic polynomial algorithmsExpand
Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)
  • A. Yao
  • Mathematics, Computer Science
  • FOCS
  • 1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply that there exists an oracle set A such that, relative to A, all theExpand
The Complexity of Computing the Permanent
  • L. Valiant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
Abstract It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations. RelatedExpand
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
  • Jin-Yi Cai
  • Mathematics, Computer Science
  • STOC '86
  • 1986
TLDR
It is shown that a random oracle set A separates PSPACE from the entire polynomial-time hierarchy with probability one as a consequence of how much error a fixed depth Boolean circuit must make in computing the parity function. Expand
BPP and the Polynomial Hierarchy
  • C. Lautemann
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1983
TLDR
It is shown by pure counting arguments that BPP is contained in ΣP2, the second level of the hierarchy of the polynomial hierarchy of Meyer and Stockmeyer. Expand
A Comparison of Polynomial Time Reducibilities
Abstract Various forms of polynomial time reducibility are compared. Among the forms examined are many-one, bounded truth table, truth table and Turing reducibility. The effect of introducingExpand
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
TLDR
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems. Expand
The power of counting
  • U. Schöning
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
An overview of applications and variations of counting in structural complexity theory is provided. It is argued that the capacity for exact counting is closely related with the capacity forExpand
Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy
  • L. Babai
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1987
TLDR
It is proved that this result actually follows immeadiately from Yao's theorem, using a simple construction of Ajtai and Ben-Or (1984) to eliminate randomization in bounded-depth Boolean circuits. Expand
...
1
2
3
4
5
...