Skip to main content
SpringerLink
Log in

Strong Reductions and Isomorphism of Complete Sets

  • Conference paper
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4855))

Abstract

We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results.

  • If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic.

  • If NP ∩ co − NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L., Manders, K.: Reducibility, randomness, and intractability. In: Proc. 9th ACM Symp. Theory of Computing, pp. 151–163. ACM Press, New York (1977)

    Google Scholar 

  2. Agrawal, A., Allender, E., Impagliazzo, R., Pitassi, T., Rudich, S.: Reducing the complexity of reductions. Computational Complexity 10, 117–138 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Agrawal, M.: The first-order isomorphism theorem. In: Foundations of Software Technology and Theoretical Computer Science, pp. 70–82 (2001)

    Google Scholar 

  4. Agrawal, M.: Towards uniform AC 0-isomorphisms. In: Proceedings of 16th IEEE Conference on Computational Complexity, pp. 13–20. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  5. Agrawal, M.: Pseudo-random generators and structure of complete degrees. In: 17th Annual IEEE Conference on Computational Complexity, pp. 139–145. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  6. Agrawal, M., Allender, E., Rudich, S.: Reductions in circuit complexity: An isomorphism theorem and a gap theorem. Journal of Computer and System Sciences 57(2), 127–143 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Agrawal, M., Biswas, S.: Polynomial-time isomorphism of 1-L complete sets. In: Proceedings of Structure in Complexity Theory, pp. 75–80 (1993)

    Google Scholar 

  8. Allender, E.: Isomorphisms and 1-L reductions. Journal of Computer and System Sciences 36, 336–350 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  9. Allender, E.: Some pointed questions concerning asymptotic lower bounds, and new from the isomorphism front. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: Entering the 21st Century, pp. 25–41. Scientific Press (2001)

    Google Scholar 

  10. Allender, E., Balcazar, J., Immerman, N.: A first-order isomorphism theorem. SIAM Journal on Computing 26, 557–567 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ambos-Spies, K., Terwijn, S.A., Zheng, X.: Resource bounded randomness and weakly complete problems. Theoretical Computer Science 172(1–2), 195–207 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Berman, L.: Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University (1977)

    Google Scholar 

  13. Berman, L., Hartmanis, H.: On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, 305–322 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Buhrman, H., Torenvliet, L.: On the structure of complete sets. In: 9th IEEE Annual Conference on Structure in Complexity Theory, pp. 118–133. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  15. Durrett, R.: Probability: Theory and Examples. Duxbury Press, third edition (2004)

    Google Scholar 

  16. Hitchcock, J., Pavan, A.: Comparing reductions to NP-complete sets. Information and Computation 205(5), 694–706 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Juedes, D.W., Lutz, J.H.: Weak completeness in E and E2. Theoretical Computer Science 143(1), 149–158 (1995)

    MathSciNet  MATH  Google Scholar 

  19. Kurtz, S., Mahaney, S., Royer, J.: The structure of complete degrees. In: Selman, A. (ed.) Complexity Theory Retrospective, pp. 108–146. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  20. Lutz, J.H.: Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences 44(2), 220–258 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lutz, J.H.: The quantitative structure of exponential time. In: Hemaspaandra, L.A., Selman, A.L. (eds.) Complexity Theory Retrospective II, pp. 225–254. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  22. Lutz, J.H., Mayordomo, E.: Twelve problems in resource-bounded measure. Bulletin of the European Association for Theoretical Computer Science, 68, 64–80, 1999. Also in Current Trends in Theoretical Computer Science: Entering the 21st Century, pp. 83–101, World Scientific Publishing (2001)

    Google Scholar 

  23. Ville, J.: Étude Critique de la Notion de Collectif. Gauthier–Villars, Paris (1939)

    Google Scholar 

  24. Wang, Y.: The law of the iterated logarithm for p-random sequences. In: Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, pp. 180–189. IEEE Computer Society Press, Los Alamitos (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wyoming, USA

    Ryan C. Harkins & John M. Hitchcock

  2. Department of Computer Science, Iowa State University, USA

    A. Pavan

Authors
  1. Ryan C. Harkins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John M. Hitchcock
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Pavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. Arvind Sanjiva Prasad

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harkins, R.C., Hitchcock, J.M., Pavan, A. (2007). Strong Reductions and Isomorphism of Complete Sets. In: Arvind, V., Prasad, S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77050-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77050-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77049-7

  • Online ISBN: 978-3-540-77050-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation