Complete Problems

  • Carl H. Smith
Part of the Graduate Texts in Computer Science book series (TCS)


In our study of unsolvable problems, we associated a set with each problem. In essence, we discussed only problems of the form “does x have a certain property.” By coding programs onto IN, many natural problems in computer science can be represented as sets. From our study of abstract complexity we know that there are sets (problems) for which deciding membership is arbitrarily difficult. A problem is “complete” for some class if it is the “hardest” problem in the class. If you have some class of sets and a complete problem for the set, then that complete problem embodies all that is difficult about any problem in the class. For example, we will show that K is complete for r.e. sets.


Turing Machine Hamiltonian Cycle Vertex Cover Recursive Function Conjunctive Normal Form 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Coo]
    S. Cook, The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, ACM, New York, 1971, pp. 151–158.Google Scholar
  2. [G&J]
    M. Garey and D. Johnson, Computers and Intractability, A Guide to NP-Completeness, W. H. Freeman and Co., San Francisco, 1979.Google Scholar
  3. [H&S1]
    J. Hartmanis and R. Sterns, On the computational complexity of algorithms, Transactions of the AMS, Vol. 117, 1965, pp. 285–306.MATHCrossRefGoogle Scholar
  4. [H&S2]
    F. Hennie and R. Sterns, Two-tape simulation of multiple tape Turing machines, Journal of the ACM, Vol. 13, 1966, pp. 533–546.MATHCrossRefGoogle Scholar
  5. [Imm]
    N. Immerman, Deterministic space is closed under complementation, SIAM Journal of Computing, Vol. 7, 1988, pp. 935–938.MathSciNetCrossRefGoogle Scholar
  6. [Kar]
    R. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, edited by R. Miller and J. Thatcher, Plenum Press, New York, 1972.Google Scholar
  7. [Pos]
    E. Post, Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, Vol. 50, 1944, pp. 284–316.MathSciNetMATHCrossRefGoogle Scholar
  8. [Sav]
    W. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and Systems Sciences, Vol. 4, 1970, pp. 177–192.MathSciNetMATHCrossRefGoogle Scholar
  9. [Sze]
    R. Szelpcsenyi, The method of forced enumeration for nondeterministic automata, Acta Informatica, 1988, pp. 279–284.Google Scholar
  10. [Tur]
    A. Turing, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London Mathematical Society, Vol. 42, 1936, pp. 230–265, with a correction in Vol. 43, 1937, pp. 544-546.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Carl H. Smith
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandCollege ParkUSA

Personalised recommendations