Comparing Complexity Classes

@article{Book1974ComparingCC,
  title={Comparing Complexity Classes},
  author={Ronald V. Book},
  journal={J. Comput. Syst. Sci.},
  year={1974},
  volume={9},
  pages={213-229}
}
Complexity classes defined by t ime-bounded and space-bounded Tur ing acceptors are studied in order to learn more about the cost of deterministic simulation of nondeterministic processes and about time-space tradeoffs. Here complexity classes are compared by means of reducibilities and class-complete sets. The classes studied are defined by bounds of the order n, n ~, 2 n, 2 n~. The results do not establish the existence of possible relationships between these classes; rather, they show the… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Computational complexity--theory and practice, in "Currents in the Theory of Computing" (A

  • A. BORODIN
  • Aho, Ed.), Prentice-Hall, Englewood Cliffs, N J,
  • 1973

Contributions to the model theory of finite structures, Ph.D

  • R. FAGIN
  • dissertation, Univ. of California,
  • 1973

H

  • AN J. HARTMANIS
  • HUNT, The LBA problem and its importance in the…
  • 1973

A

  • AN N. Jonas
  • SELMAN, Turing machines and the spectra of first…
  • 1972

STOCKMEYER, The equivalence problem for regular expressions with COMPARING COMPLEXITY CLASSES 229 squaring requires exponential space, Conf

  • L. A. MEYER
  • Record IEEE Thirteenth Annual Symposium on…
  • 1972

Similar Papers

Loading similar papers…