A survey on counting classes

@article{Gundermann1990ASO,
  title={A survey on counting classes},
  author={T. Gundermann and N. Nasser and G. Wechsung},
  journal={Proceedings Fifth Annual Structure in Complexity Theory Conference},
  year={1990},
  pages={140-153}
}
Consideration is given to polynomial-time machines. Among these classes are EP and PP. 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 relativization results. Further results concerning the relationships of such classes in unrelativized and relativized worlds are given.<<ETX>> 
Algebraic acceptance mechanisms for polynomial time machines
TLDR
Several results are presented, whose common theme is the application of (quite basic) algebraic techniques to describe complexity classes, which appear in the many ways nondeterministic polynomial time machines can be used (or abused). Expand
Extension of Toda's Theorem to Middle Bit Classes
In this paper we overview recent results concerning complexity classes that are deened in terms of the number of accepting paths of nondeter-ministic polynomial-time Turing machines. Of centralExpand
PP is closed under intersection
TLDR
It is shown that PP is closed under a variety of polynomial-time truth-table reductions and in complexity theory include the definite collapse and (assuming P ? PP) separation of certain query hierarchies over PP. 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
Complexity Classes with Finite Acceptance Types
TLDR
The proof technique uses a key lemma which transforms the inclusionship question for these classes into an existence question for certain hypergraphs, under which one class is contained in another one relative to all oracle seperation. Expand
A Promise Class at Least as Hard as the Polynomial Hierarchy
In this paper, an open problem raised by Toda and Ogiwara is reformulated in the context of promise problems to make precise its very nature---thereby answering it partially---which, by intuition, isExpand
On the power of deterministic reductions to C=P
  • Frederic Green
  • Mathematics, Computer Science
  • Mathematical systems theory
  • 2005
TLDR
It is shown that there exists an oracleA such that there exist techniques that would prove that C=P and PP are polynomial-time Turing equivalent, or that C-C=P is polynomially Turing hard for the polynometric-time hierarchy, would not relativize. Expand
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
The Chain Method to Separate Counting Classes
TLDR
All relativizable inclusions between classes NP(k) from the Boolean Hierarchy over NP and other classes defined by what the authors call bounded counting are completely characterized. Expand
Bounded Queries to Arbitrary Sets
  • A. Lozano
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 1996
We prove that if P A k-T = P A (k +1)-T for some k and an arbitrary set A, then A is reducible to its complement under a relativized nondeterministic conjunctive reduction. By substituting A byExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Relativized Counting Classes: Relations among Thresholds, Parity, and Mods
  • R. Beigel
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1991
TLDR
A simple combinatorial technique for constructing oracles that separate counting classes is developed and it is suggested that it will be difficult to resolve the unknown relationships among different counting classes. Expand
On Counting and Approximation
We introduce a new class of functions, called span functions which count the different output values that occur at the leaves of the computation tree associated with a nondeterministic polynomialExpand
On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP
It is shown that probabilistic time is closed under polynomial-time parity reductions. Therefore, every set polynomial-time truth-table reducible to SAT is accepted by a probabilistic polynomial-timeExpand
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
On Counting Problems and the Polynomial-Time Hierarchy
  • D. Angluin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1980
TLDR
The main result is that there exists an oracle set A such that PPA −(Π2P,A ∪ σ2 P,A) ≠ ∅, with the corollary that also D ≠PA − (Π 2P, a ∪σ2 p, A) ≦ ∅. Expand
Enumerative counting is hard
TLDR
It is proved that if there is a good polynomial-time enumerator for Hash P (i.e. one where the small set has at most O( mod f mod /sup 1-e/) numbers), then P=NP=P/sup Hash P/ and probabilisticPolynomial time equals polynometric time. Expand
On the computational power of PP and (+)P
  • Seinosuke Toda
  • Mathematics, Physics
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
It follows that neither PP nor (+)P is a subset of or equivalent to PH unless PH collapses to a finite level, strong evidence that both classes are strictly harder than PH. Expand
Nondeterministic Turing Machines with Modified Acceptance
TLDR
In this paper an extremely fine hierarchy within BC(NP) is proposed, characterized by nondeter-ministic polynomial time Turing machines with suitably modified acceptance notions. 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
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
...
1
2
...