Skip to main content
SpringerLink
Log in

The structure of polynomial complexity cores

Extended abstract

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 176))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Balcázar and U. Schöning, Bi-immune sets for complexity classes. Math. Syst. Theory (1984), to appear.

    Google Scholar 

  2. L. Berman, On the structure of complete sets: almost everywhere complexity and infinitely often speedup. 17th FOCS (1976), 76–80.

    Google Scholar 

  3. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets. SIAM J. Computing 6 (1977), 305–322.

    Google Scholar 

  4. P. Berman, Relationship between density and deterministic complexity of NP-complete languages. 5th ICALP, Lecture Notes in Computer Science 62, 63–71, Springer-Verlag, 1978.

    Google Scholar 

  5. S. Even, A.L. Selman, and Y. Yacobi, Hard-core theorems for complexity classes. To appear.

    Google Scholar 

  6. G. Grätzer, Lattice Theory. Freeman & Co., 1971.

    Google Scholar 

  7. K. Ko and D. Moore, Completeness, approximation and density. SIAM J. Computing 10 (1981), 787–796.

    Google Scholar 

  8. N. Lynch, On reducibility to complex or sparse sets. Journal of ACM 22 (1975), 341–345.

    Google Scholar 

  9. S.R. Mahaney, Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis. J. Comput. Syst. Sci. 25 (1982), 130–143.

    Google Scholar 

  10. A.R. Meyer and M.S. Paterson, With what frequency are apparently intractable problems difficult? M.I.T. Technical Report TM-126, Feb. 1979.

    Google Scholar 

  11. P. Young, Some structural properties of polynomial reducibilities and sets in NP. 15th ACM STOC (1983), 392–401.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, SF-00250, Helsinki 25, Finland

    Pekka Orponen

  2. Institut für Informatik, Universität Stuttgart, D-7000, Stuttgart 1, West Germany

    Uwe Schöning

Authors
  1. Pekka Orponen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Schöning
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orponen, P., Schöning, U. (1984). The structure of polynomial complexity cores. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030328

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation