Advertisement

Acta Informatica

, Volume 6, Issue 1, pp 77–88 | Cite as

Hierarchies of complete problems

  • Zvi Galil
Article

Summary

An attempt is made to present a framework for the diverse complete problems that have been found. A new concept—a Hierarchy of Complete Problems is defined. Several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established.

Keywords

Information System Operating System Data Structure Communication Network Graph Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook, S. A.: The complexity of theorem proving procedures. Proceedings of 3rd Annual ACM Symposium of Theory of Computing, Sheiker Heights (Ohio) 1971, p. 151–158Google Scholar
  2. 2.
    Cook, S. A.: An observation on time-storage trade off. Proceedings of 5th Annual ACM Symposium on Theory of Computing, Austin (Tex.) 1973, p. 29–33Google Scholar
  3. 3.
    Even, S., Tarjan, R. E.: A combinational problem which is complete in polynomial space. Proceedings of 7th Annual ACM Symposium on Theory of Computing, Albuquerque (New Mexico) 1975, p. 66–71Google Scholar
  4. 4.
    Galil, Z.: On some direct encodings of nondeterministic Turing machines operating in polynomial time into P-complete problems. SIGACT News 6, 19–24 January 1974CrossRefGoogle Scholar
  5. 5.
    Gardner, M.: The fantastic combinations of John Conway's new solitaire game ‘Life’. Scientific American 223, 120–123 (1970)CrossRefGoogle Scholar
  6. 6.
    Garey, M. R., Johnson, D. S., Stockmeyer, L. J.: Some simplified NP-complete problems. Proceedings of 6th ACM Symposium on Theory of Computing, Seattle (Wash.) 1974, p. 91–95Google Scholar
  7. 7.
    Gill, J. T.: Computational complexity of probabilistic Turing machines. Proceedings 6th Annual ACM Symposium on Theory of Computing, Seattle (Wash.) 1974, p. 91–95Google Scholar
  8. 8.
    Greibach, S. A.: Checking automata and one-way stack languages. J. Computer and System Sciences 3, 196–217 (1969)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hartmanis, J., Hunt, III., H. B.: The LBA problem and its importance in the theory of computing. Cornell University, Technical Report 73–171, 1973Google Scholar
  10. 10.
    Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969zbMATHGoogle Scholar
  11. 11.
    Jones, N. D.: Reducibility among combinatorial problems in logn space. Proceedings of 7th Annual Princeton Conference on Information Sciences and Systems, 1973, p. 547–551Google Scholar
  12. 12.
    Jones, N. D., Laaser, W. T.: Complete problems for deterministic polynomial time. Proceedings of 6th Annual ACM Symposium on Theory of Computing, Seattle (Wash.) 1974, p. 40–46Google Scholar
  13. 13.
    Karp, R. M.: Reducibilities among combinatorial problems. In: Miller, R., Thatcher, J. (eds): Complexity of computer computations. New York: Plenum Press 1972, p. 85–104CrossRefGoogle Scholar
  14. 14.
    Ladner, R., Lynch, N., Selman, A.: Comparison of polynomial time reducibilities. Proceedings of 6th Annual ACM Symposium on Theory of Computing, Seattle (Wash.) 1974, p. 110–121Google Scholar
  15. 15.
    Meyer, A. R., Stockmeyer, L. J.: Word problems requiring exponential time. Proceedings of 5th Annual ACM Symposium on Theory of Computing, Austin (Tex.) 1973, p. 1–9Google Scholar
  16. 16.
    Rogers, J., Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967zbMATHGoogle Scholar
  17. 17.
    Savitch, W. J.: Relationship between nondeterministic and deterministic tape complexities. J. Computer and System Sciences 4, 177–192 (1970)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • Zvi Galil
    • 1
  1. 1.Computer Sciences DepartmentIBM T. J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations