Skip to main content
SpringerLink
Log in

NP-Creative sets: A new class of creative sets in NP

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We obtain a new definition of creativeness for NP, called NP-creativeness. We show that all NP-creative sets are NP-complete and provide strong evidence that all known NP-complete sets are NP-creative. We also show that all NP-creative sets are complete under exponentially honest reductions and contain an infinite NP subset in their complement (in other words, they are not NP-simple).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Balcázar, J. Díaz, and J. Gabarró.Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  2. K. Ganesan and S. Homer. Complete problems and strong polynomial reducibilities. InProceedings of the Symposium on Theoretical Aspects of Computer Science, pages 240–250. Lecture Notes in Computer Science, Vol. 349. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  3. J. Hartmanis and L. Hemachandra. One-way functions and the non-isomorphism of NP-complete sets.Theoretical Computer Science, 81(1):155–163, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Homer. On simple and creative sets in NP.Theoretical Computer Science, 47:169–180, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  5. D. Joseph and P. Young. Some remarks on witness functions for nonpolynomial and noncomplete sets in NP.Theoretical Computer Science, 39:225–237, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  6. K. Ko and D. Moore. Completeness, approximation and density.SIAM Journal on Computing, 10:787–796, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  7. H. Rogers.Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

  8. A. L. Selman. A survey of one-way functions in complexity theory.Mathematical Systems Theory, 25:203–221, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Wang. Some remarks on polynomial time isomorphisms. InProceedings of the International Conference on Computing and Information, pages 144–153. Lecture Notes in Computer Science, Vol. 468. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  10. J. Wang. On p-creative sets and p-completely creative sets.Theoretical Computer Science, 85:1–31, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. Wang. Polynomial time productivity, approximations, and levelability.SIAM Journal on Computing, 21:1100–1111, 1992.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 208 016, Kanpur, India

    M. Agrawal & S. Biswas

Authors
  1. M. Agrawal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agrawal, M., Biswas, S. NP-Creative sets: A new class of creative sets in NP. Math. Systems Theory 29, 487–505 (1996). https://doi.org/10.1007/BF01184812

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01184812

Keywords

Search

Navigation