Advertisement

Abstract

Two structurally defined types of NP sets are studied. k-simple sets are defined and shown to exist in NP. Other properties of these sets are investigated. k-creative sets, as previously defined by Joseph and Young [10], are next considered. A new condition is given which implies that a set is k-creative. Several previously considered NP-complete sets are proved to be k-creative.

Keywords

Turing Machine Step Simulation Infinite Subset Tiling Problem Recursive Enumeration 
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.
    Balcazar, J., "Simplicity", manuscript.Google Scholar
  2. 2.
    Balcazar, J. and U. Schőning, "Bi-immune sets for complexity classes", Math. Syst. Theory, 18 (1985), pp. 1–10.Google Scholar
  3. 3.
    Berman, L. and J. Hartmanis, "On isomorphisms and density of NP and other complete sets", SIAM J. Comp. 1 (1977), pp. 305–322.Google Scholar
  4. 4.
    Van Emde Boas, P. and M.W.P. Savelsbergh, "Bounded tiling, an alternative to satisfiability", Tech. Report OS-R8405, University of Amsterdam, 1984.Google Scholar
  5. 5.
    Book, R. and U. Schőning, "Immunity, relativizations and nondeterminism", SIAM J. Comput. 13 (1984), pp. 329–337.Google Scholar
  6. 6.
    Garey, M. and D. Johnson, Computers and Intractability, W.H. Freeman and Co., 1979.Google Scholar
  7. 7.
    Hartmanis, J., "A note on natural creative sets and Gödel numberings", Theor. Comp. Sci, (1984).Google Scholar
  8. 8.
    Homer, S., "On Creative sets in NP", B.U. Tech. Report TR-2-83.Google Scholar
  9. 9.
    Homer, S. and W. Maass, "Oracle dependent properties of the lattice of NP sets", Theor. Comp. Sci., (1984), pp. 279–289.Google Scholar
  10. 10.
    Joseph, D. and P. Young, "Some remarks on witness functions for non-polynomial sets in NP", I. Theor. Comp. Sci., R. (1985), pp. 225–238.Google Scholar
  11. 11.
    Ko, K. and D. Moore, "Completeness, approximation and density", SIAM J. Comp. 10 (1981), pp. 787–796.Google Scholar
  12. 12.
    Ladner, R., "On the structure of polynomial time reducibility", J. Assoc. Comp. Mach. 22 (1975), pp. 155–171.Google Scholar
  13. 13.
    Levin, L.A., "Universal sequential search problems", Problems of Information Transmission 9 (1973), pp. 265–266.Google Scholar
  14. 14.
    Lewis, H.R. and C. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, 1981.Google Scholar
  15. 15.
    Post, E.L., "Recursively enumerable sets of positive integers and their decision problems", Bull. AMS, (50)(1954), pp. 284–316.Google Scholar
  16. 16.
    Young, P., "Some structural properties of polynomial reducibilities and sets in NP", Proc. 15th Annual ACM Symp. on Theory of Comp., (1983), p. 392–401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Steven Homer
    • 1
  1. 1.Computer Science DepartmentBoston UniversityBostonUSA

Personalised recommendations