skip to main content
research-article

Unions of Disjoint NP-Complete Sets

Published:01 March 2014Publication History
Skip Abstract Section

Abstract

We study the following question: if A and B are disjoint NP-complete sets, then is AB NP-complete? We provide necessary and sufficient conditions under which the union of disjoint NP-complete sets remain complete.

References

  1. M. Agrawal. 2002. Pseudo-random generators and structure of complete degrees. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity. IEEE Computer Society, 139--145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Berman and H. Hartmanis. 1977. On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, 2, 305--322.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Even, A. Selman, and Y. Yacobi. 1984. The complexity of promise problems with applications to public-key cryptography. Inform. Control 61, 2, 159--173. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Fortnow, J. H. Lutz, and E. Mayordomo. 2010. Inseparability and strong hypotheses for disjoint NP pairs. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (Leibniz International Proceedings in Informatics). Vol. 5. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 395--404.Google ScholarGoogle Scholar
  5. C. Glaßer, A. Selman, and S. Sengupta. 2005. Reductions between disjoint NP-Pairs. Inform. Comput. 200, 2, 247--267. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Glaßer, A. Pavan, A. Selman, and S. Sengupta. 2006. Properties of NP-complete sets. SIAM J. Comput. 36, 2, 516--542. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Glaßer, A. Selman, and L. Zhang. 2007. Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370, 1, 60--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Glaßer, A. Pavan, A. Selman, and L. Zhang. 2008a. Splitting NP-complete sets. SIAM J. Comput. 37, 5, 1517--1535. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. Glaßer, A. Selman, S. Travers, and K. W. Wagner. 2008b. The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74, 7, 1173--1187. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Goldreich. 2006. On promise problems: A survey. In Theoretical Computer Science - Essays in Memory of Shimon Even. Lecture Notes in Computer Science, vol. 3895, Springer, 254--290. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Grollmann and A. Selman. 1988. Complexity measures for public-key cryptosystems. SIAM J. Comput. 17, 2, 309--355. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Impagliazzo and A. Wigderson. 2001. Randomness vs. time: Derandomization under a uniform assumption. J. Comput. System Sci. 63, 4, 672--688. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Jackson and R. Servedio. 2005. On learning random DNF formulas under the uniform distribution. In Proceedings of the 9th International Workshop on Randomness and Computation. Lecture Notes in Computer Science, vol. 3624, Springer, 342--353. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. Kabanets. 2001. Easiness assumptions and hardness tests: Trading time for zero error. J. Comput. Syst. Sci. 63, 2, 236--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Pudlak. 2001. On reducibility and symmetry of disjoint NP-pairs. Tech. rep. TR01-044, Electronic Colloquium on Computational Complexity.Google ScholarGoogle Scholar
  16. A. Razborov. 1994. On provably disjoint NP pairs. Tech. rep. TR94-006, Electronic Colloquium on Computational Complexity.Google ScholarGoogle Scholar
  17. R. Santhanam. 2009. Circuit lower bounds for Merlin-Arthur classes. SIAM J. Comput. 39, 3, 1038--1061. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. A. Selman. 1988. Natural self-reducible sets. SIAM J. Comput. 17, 5, 989--996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Unions of Disjoint NP-Complete Sets

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 6, Issue 1
      March 2014
      92 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/2600088
      Issue’s Table of Contents

      Copyright © 2014 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 March 2014
      • Accepted: 1 August 2013
      • Revised: 1 July 2013
      • Received: 1 February 2013
      Published in toct Volume 6, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed
    • Article Metrics

      • Downloads (Last 12 months)7
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!