Skip to main content
SpringerLink
Log in

Self-Reducibility: Effects of Internal Structure on Computational Complexity

  • Chapter
Complexity Theory Retrospective

Abstract

In this paper we discuss the effect that self-reducibility properties have on the analysis of complexity classes. We begin by reviewing some of the more elementary results for readers unfamiliar with the field, and then we discuss some recent results and directions where self- reducibilities have been useful. Throughout, we focus on the question of when self-reducibility properties cause sets, or classes of sets, to have lower complexity than might otherwise be expected. This paper is an attempt to provide an overview of known results and suggest unifying concepts. By doing so we suggest that a continuing systematic study of the relationship between the internal structure of a set and the computational complexity of a set is in order.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. Amir and W. Gasarch. Polynomial terse sets. Inform, and Compute 76, 1988.

    Google Scholar 

  2. J. Balcázar. Self-reducibility. J. Comput. Systems Sci., 1990. To appear.

    Google Scholar 

  3. J. Balcázar. Self-reducibility structures and solutions of NP problems. Revista Matematica, 1990. To appear.

    Google Scholar 

  4. J. Balcázar, R. Book, and U. Schöning. The polynomial-time hierarchy and sparse oracles. J. Assoc. Comput. Machinery, 33 (3): 603–617, 1986.

    Article  MATH  Google Scholar 

  5. A. Borodin and A. Demers. Some comments on functional self- reducibility and the NP hierarchy. Technical Report TR76-284, Cornell University, Department of Computer Science, 1976.

    Google Scholar 

  6. R. Beigel. Query-limited Reducibilities. PhD thesis, Stanford University, October 1987.

    Google Scholar 

  7. R. Beigel. A structural theorem that depends quantitatively on the complexity of SAT. J. Comput. Systems Sci., 1990. This paper was presented at the 2nd Annual Structure in Complexity Theory Conf. in 1987.

    Google Scholar 

  8. P. Berman. Relationships between density and deterministic complexity of NP-complete languages. In 5th EAT CS Conference in Automata, Languages and Programming, pages 63–71, Springer-Verlag, Lecture Notes in Computer Science, Berlin, 1978.

    Google Scholar 

  9. R. Beigel, W. Gasarch, J. Gill, and J. Owings. Terse, super- terse and verbose sets. Preprint, 1–25, 1986.

    Google Scholar 

  10. R. Beigel, W. Gasarch, and L. Hay. Bounded Query Classes and the Difference Hierarchy. Technical Report 1847, University of Maryland, 1987.

    Google Scholar 

  11. R. Beigel, W. Gasarch, and J. Owings. Terse sets and verbose sets. Recursive Function Theory: Newsletter, 36: 13–14, 1987.

    Google Scholar 

  12. R. Boppana, J. Håstad, and S. Zachos. Does coNP have short interactive proofs? Inform. Process. Letters, 25: 127–132, 1987.

    Article  MATH  Google Scholar 

  13. D. Bruschi, D. Joseph, and P. Young. A structural overview of NP optimization problems. In Proc. of the 2nd International Conference on Optimal Algorithms, Springer-Verlag, Lecture Notes in Computer Science, 1990. 27 pages.

    Google Scholar 

  14. R. Book and K. Ko. On sets reducible to sparse sets. In Proc. 3rd Annual Structure in Complexity Theory Conf., pages 147–154, 1987.

    Google Scholar 

  15. J. Balcäzar and U. Schöning. Logarithmic advice classes. EATCS J. Theor. Comput. Sci., ():, 1990. To appear.

    Google Scholar 

  16. S. Fortune. A note on sparse complete sets. SIAM J. Comput., 8: 431–433, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Goldsmith, L. Hemachandra, D. Joseph, and P. Young. Near- testable sets. Technical Report, University of Wisconsin, Computer Sciences Dept., 1987.

    Google Scholar 

  18. J. Goldsmith, D. Joseph, and P. Young. Self-reducible, p-selective, near-testable, and p-cheatable sets: the effect of internal structure on the complexity of a set. In Proc. 2nd Annual Structure in Complexity Theory Conf., pages 50–59, 1987.

    Google Scholar 

  19. J. Goldsmith, D. Joseph, and P. Young. A note on bi-immunity and p-closeness of p-cheatable sets in P poly. Technical Report 741-1987, University of Wisconsin, Computer Sciences Dept., 1990. [To appear in J. Comput. Systems Sci.].

    Google Scholar 

  20. J. Goldsmith, D. Joseph, and P. Young. Using self-reducibilities to characterize polynomial time. Technical Report 749-1987, University of Wisconsin, Computer Sciences Dept., 1990. [To appear in Inform, and Comput.].

    Google Scholar 

  21. J. Hartmanis and L. Hemachandra. One-way functions, robust-ness, and the non-isomorphism of NP-complete sets. In Proc. 2nd Annual Structure in Complexity Theory Conf, pages 160–174, 1987. To appear in the EATCS J. Theor. Comput. Sci.

    Google Scholar 

  22. N. Immerman. Nondeterministic space is closed under comple-mentation. SIAM J. Comput., 17 (5): 935–938, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  23. D. Joseph, T. Long, and P. Young. How bounded truth-table reductions to sparse sets collapse the polynomial time hierarchy. Preprint, 10, 1989.

    Google Scholar 

  24. C. Jockusch. Semirecursive sets and positive reducibility. Trans. Amer. Math. Soc., 131: 420–436, 1968.

    Article  MathSciNet  MATH  Google Scholar 

  25. J. Kadin. PNP[log n] and sparse Turing-complete sets for NP. In Proc. 1st Annual Structure in Complexity Theory Conf., pages 33–40, 1987.

    Google Scholar 

  26. N. Karmarkar and R. Karp. An efficient approximation scheme for the one dimensional bin-packing problem. In Proc. 23rd IEEE Symp. Found. Comput. Sci., pages 312–320, 1982.

    Google Scholar 

  27. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proc. 12th ACM Symp. Theory of Comput., pages 302–309, 1980. [Also published as, Turing machines that take advice, L’Ensignement Mathématique, 28:191–210, 1982.].

    Google Scholar 

  28. K. Ko. On self-reducibility and weak P-selectivity. J. Comput. Systems Sci., 26: 209–211, 1983.

    Article  MATH  Google Scholar 

  29. K. Ko. On helping by robust oracle machines. In Proc. 2nd Annual Structure in Complexity Theory Conf, pages 182–190, 1987.

    Google Scholar 

  30. K. Ko. Distinguishing bounded reducibilities by sparse sets. In Proc. 3rd Annual Structure in Complexity Theory Conf., pages 181–191, 1988.

    Chapter  Google Scholar 

  31. M. Krentel. The complexity of optimization problems. J. Com-put. Systems Sci., 36: 490–509, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  32. T. Long. Strong nondeterministic polynomial-time reducibilities. EATCS J. Theor. Comput. Sci., 21: 1–25, 1982.

    Article  MATH  Google Scholar 

  33. S. Mahaney. Sparse complete sets for NP: solution of a con-jecture of Berman and Hartmanis. J. Comput. Systems Sci., 25: 130–143, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  34. S. Mahaney. Sparse sets and reducibilities. In R. Book, editor, Studies in Complexity Theory, pages 63–118, Pitman, 1986.

    Google Scholar 

  35. S. Mahaney. The isomorphism conjecture and sparse sets. In J. Hartmanis, editor, Computational Complexity Theory, page, American Mathematical Society, 1989.

    Google Scholar 

  36. A. Meyer and M. Paterson. With What Frequency are apparently Intractable Problems Difficult? Technical Report MIT/LCS/TM-126, M.I.T., 1979.

    Google Scholar 

  37. C. Papadimitriou and M. Yannakakis. The complexity of facets and some facets of complexity. J. Comput. Systems Sci., 28: 244–259, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  38. C. Papadimitriou and M. Yannakakis. Optimization, approx-imation and complexity classses. In Proc. 20th ACM Symp. Theory of Comput., pages 229–234, 1988.

    Google Scholar 

  39. C. Schnorr. Optimal algorithms for self-reducible problems. In 3rd EATCS Conference in Automata, Languages and Programming, pages 322–337, Edinburgh, University Press, July 1976.

    Google Scholar 

  40. C. Schnorr. On self-transformable combinatorial problems. Symp. on Math. Optimierung, Oberwolfach, 1979.

    Google Scholar 

  41. U. Schöning. Robust algorithms a different approach to oracles. EATCS J. Theor. Comput. Sci., 40: 57–66, 1985.

    Article  MATH  Google Scholar 

  42. A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory, 13: 55–65, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  43. A. Selman. Analogues of semirecursive sets and effective re-ducibilities to the study of NP complexity. Inform, and Control, 52 (1): 36–51, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  44. A. Selman. Reductions on NP and P-selective sets. EATCS J. Theor. Comput. Sci., 19: 287–304, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  45. A. Selman. Remarks About Natural Self-Reducible Sets in NP and Complexity Measures for Public-key Crypto systems. Technical Report, Iowa State University, 1984.

    Google Scholar 

  46. A. Selman. Natural self-reducible sets. SIAM J. Comput., 17: 989–996, 1988.

    Article  MathSciNet  Google Scholar 

  47. A. Selman. Promise problems complete for complexity classes. Inform, and Comput, 78: 87–98, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  48. R. Szelepcsényi. The method of forced enumeration for nonde-terminisitc automata. Acta Inform, 26: 279–284, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  49. B. Trachtenbrot. On autoreducibility. Dokl. Akad. Nauk. SSSR, 11: 335–350, 1970.

    Google Scholar 

  50. E. Ukkonen. Two results on polynomial time Turing reductions to sparse sets. SIAM J. Comput., 12: 580–587, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  51. K. Wagner. Bounded query computations. In Proc. 3rd Annual Structure in Complexity Theory Conf., pages 260–277, 1988.

    Chapter  Google Scholar 

  52. K. Wagner. More complicated questions about maxima and minima, and some closures of NP. EATCS J. Theor. Comput. Sci., 51: 53–80, 1988.

    Article  Google Scholar 

  53. K. Wagner and G. Wechsung. Computational Complexity. D. Reidel Publishing Co., 1986.

    Google Scholar 

  54. C. K. Yap. Some consequences of non-uniform conditions nonuniform classes. EATCS J. Theor. Comput. Sci., 26: 287–300, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  55. Y. Yesha. On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM J. Comput., 12: 411–425, 1983.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, Madison, WI, USA

    Deborah Joseph

  2. Computer Science Department, University of Washington, Seattle, WA, USA

    Paul Young

Authors
  1. Deborah Joseph
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Young
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science, Northeastern University, Boston, MA, 02115, USA

    Alan L. Selman

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Joseph, D., Young, P. (1990). Self-Reducibility: Effects of Internal Structure on Computational Complexity. In: Selman, A.L. (eds) Complexity Theory Retrospective. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4478-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4478-3_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8793-3

  • Online ISBN: 978-1-4612-4478-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation