Complexity Classes

@inproceedings{Allender2010ComplexityC,
  title={Complexity Classes},
  author={Eric Allender and Michael C. Loui and Kenneth W. Regan},
  year={2010}
}
This material was written for Chapter 27 of the CRC Handbook of Algorithms and Theory of Computation, edited by Mikhail Atallah. 

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

A taxonomy of problems with fast parallel algorithms

S. Cook
  • [Cook,
  • 1985
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

A Turing Machine Time Hierarchy

  • Theor. Comput. Sci.
  • 1983
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

On Uniform Circuit Complexity

  • J. Comput. Syst. Sci.
  • 1981
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

On Relating Time and Space to Size and Depth

  • SIAM J. Comput.
  • 1977
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Comparing Complexity Classes

  • J. Comput. Syst. Sci.
  • 1974
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

The complexity of iterated multipli

Immerman, Landau, 1995 N. Immerman, S. Landau
  • 1995