# Counting Hierarchies: Polynomial Time and Constant Depth Circuits

@inproceedings{Allender1993CountingHP, title={Counting Hierarchies: Polynomial Time and Constant Depth Circuits}, author={Eric Allender and Klaus W. Wagner}, booktitle={Current Trends in Theoretical Computer Science}, year={1993} }

- Published in Current Trends in Theoretical Computer Science 1993
DOI:10.1142/9789812794499_0035

In the spring of 1989, Seinosuke Toda of the University of Electro-Communications in Tokyo, Japan, proved that the polynomial hierarchy is contained in P PP To-89]. In this Structural Complexity Column, we will brieey review Toda's result, and explore how it relates to other topics of interest in computer science. In particular, we will introduce the reader to The Counting Hierarchy: a hierarchy of complexity classes contained in PSPACE and containing the Polynomial Hierarchy. of circuit is… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 30 CITATIONS

## Rational proofs

VIEW 8 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## 2 A Characterization of Constant-Round Rational Proofs

VIEW 8 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A logical characterization of the counting hierarchy

VIEW 5 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## On Defining Integers And Proving Arithmetic Circuit Lower Bounds

VIEW 7 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds

VIEW 3 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Computing quantiles in Markov chains with multi-dimensional costs

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-5 OF 5 REFERENCES