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}
}
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

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 30 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

The complexity of combinatorial problems with succinctinput representation

K. W. Wagner
  • Theoretical Computer Science