On the Power of Probabilistic Polynomial Time:PNP[log] ⊆ PP

@inproceedings{Hemachandra1988OnTP,
  title={On the Power of Probabilistic Polynomial Time:PNP[log] ⊆ PP},
  author={L. Hemachandra and G. Wechsung},
  year={1988}
}
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] ~ PP. Relatedly, we show that probabilistic polynomial time is closed under polynomial-time parity reductions. 
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
On the Power of Parity Polynomial Time
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 ofExpand
Restricted Relativizations of Probablistic Polynomial Time
TLDR
A quantitative restriction on access to a given oracle for probabilistic oracle machines is introduced, denoted as PR R (·), and it is shown that for every oracle A that PP R (NP)( A ) is included in PP( A ). Expand
The polynomial method in circuit complexity
  • R. Beigel
  • Mathematics, Computer Science
  • [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
  • 1993
TLDR
The basic techniques for using polynomials in complexity theory are examined, emphasizing intuition at the expense of formality and closure properties, upper bounds, and lower bounds obtained. Expand
Exponential-Time and Subexponential-Time Sets
TLDR
It is proved that the symmetric difference of a ⩽ P k -parity -hard set for E and a subexponential-time-computable set is still ⩵ P k-parity-hard for E since a 1-Parity reduction is a many—one reduction. Expand
Counting classes are at least as hard as the polynomial-time hierarchy
  • Seinosuke Toda, M. Ogihara
  • Mathematics, Computer Science
  • [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
  • 1991
TLDR
It is shown that many natural counting classes are at least as computationally hard as PH in the following sense: for each K of the counting classes, every set in K(PH) is polynomial-time randomized many-one reducible to a set inK with two-sided exponentially small error probability. Expand
Polynomial Time 1-Turing Reductions from #PH to #P
TLDR
It is demonstrated that a weaker notion of polynomial-time reducibility is sufficiently powerful for reducing #PH functions to #P functions and that p-rankability is generalized by Hemachandra (1987). Expand
Perceptrons, PP, and the polynomial hierarchy
  • R. Beigel
  • Mathematics, Computer Science
  • computational complexity
  • 2005
AbstractWe construct a predicate that is computable by a perceptron with linear size, order 1, and exponential weights, but which cannot be computed by any perceptron having subexponentialExpand
Algorithms from complexity theory: polynomial-time operations for complex sets
TLDR
Typically, a set is described as complex when its membership problem has no efficient solution and less effort is spent determining which operations can be efficiently performed on complex sets. Expand
A Taxonomy of Complexity Classes of Functions
  • A. Selman
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1994
TLDR
A systematic comparison of several complexity classes of functions that are computed nondeterministically in polynomial time or with an oracle in NP shows that there exists a disjoint pair of NP-complete sets such that every separator is NP-hard. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 16 REFERENCES
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
On truth-table reducibility to SAT and the difference hierarchy over NP
  • S. Buss, L. Hay
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
It is shown that polynomial-time truth-table reducibility by Boolean circuits to SAT is the same as log-space truth-table reducibility via Boolean formulas to SAT and the same as log-space TuringExpand
Computational complexity of probabilistic Turing machines
TLDR
It is shown how probabilisticlinear-bounded automata can simulate nondeterministic linear-bounding automata and an example is given of a function computable more quickly by Probabilistic Turing machines than by deterministic Turing machines. Expand
Bounded query computations
  • K. Wagner
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
TLDR
The main topics are: the relationship between the number of adaptive and parallel queries, connections to the closure of NP under polynomial-time truth-table reducibility, the Boolean hierarchy, the power of one more query, sparse oracles versus few queries, and natural complete problems for the most important bounded query classes. Expand
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP
  • Jim Kadin
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1987
TLDR
The main result is that if there exists a sparse set S ϵ NP such that co-NP ( NPs, then the polynomial hierarchy (PH) is contained in PNP[O(log n], and it is shown that this collapse is optimal. Expand
On some central problems in computational complexity.
In this thesis we examine some of the central problems in the theory of computational complexity, like the trade-offs between time and memory, the power of nondeterminism and parallelism, and theExpand
On the Difference Between One and Many (Preliminary Version)
TLDR
It is shown, that in specific cases, the question, ‘Given a problem, is it more difficult to tell how many solutions the problem has than just deciding whether it has a solution?’ can be put into a mathematically meaningful form. Expand
The Boolean Hierarchy I: Structural Properties
TLDR
The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels. Expand
The Complexity of Optimization Problems
  • M. Krentel
  • Computer Science
  • Computational Complexity Conference
  • 1986
TLDR
One could say that CLIQUE is the decision version of MAX-CLIQUE and they are computationally equivalent up to polynomial time reductions. Expand
The Difference and Truth-Table Hierarchies for NP
Definition de deux hierarchies des classes de complexite. Localisation de la hierarchie de differences et de la hierarchie du tableau de verite pour NP. Exemples d'ensembles complets dans les deuxExpand
...
1
2
...