Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1987: CSL '87 pp 1–16Cite as

Diagonalizing over deterministic polynomial time

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Ambos-Spies, P-mitotic sets, in "Logic and Machines: Decision Problems and Complexity", Lecture Notes Comput. Sci. 171 (1984) 1–23, Springer-Verlag.

    Google Scholar 

  2. K.Ambos-Spies, Polynomial time degrees of NP-sets, in "Trends in Theoretical Computer Science", E.Börger, Ed., Computer Science Press, 1987, 95–142.

    Google Scholar 

  3. K. Ambos-Spies, H. Fleischhack and H. Huwig, Diagonalizations over polynomial time computable sets, Theor. Comput. Sci. 51 (1987) 177–204.

    Google Scholar 

  4. K.Ambos-Spies, H.Fleischhack and H.Huwig, Diagonalizations over polynomial time computable sets, Tech. Rep. 177 (1984), Dept. Comput. Sci., Universität Dortmund.

    Google Scholar 

  5. J. Balcazar, Self-reducibility, Proc. STACS 87, Lecture Notes Comput. Sci. 247 (1987) 136–147, Springer-Verlag.

    Google Scholar 

  6. C.H. Bennett and J. Gill, Relative to a random oracle A, PA≠NPA≠co-NPA with probability 1, SIAM J. Comput. 10 (1981) 96–113.

    Google Scholar 

  7. H.Fleischhack, On diagonalizations over complexity classes, Tech. Rep. 210 (1985), Dept. Comput. Sci., Universität Dortmund.

    Google Scholar 

  8. H. Fleischhack, P-genericity and strong P-genericity, Proc. MFCS 1986, Lecture Notes Comput. Sci. 233 (1986) 341–349, Springer-Verlag.

    Google Scholar 

  9. W. Gasarch and S. Homer, Relativizations comparing NP and exponential time, Inform. Control 58 (1983) 88–100.

    Google Scholar 

  10. S.Homer and T.J.Long, Honest polynomial degrees and P=?NP, Theor. Comput. Sci. (to appear).

    Google Scholar 

  11. S. Homer and W. Maass, Oracle dependent properties of the lattice of NP-sets, Theor. Comput. Sci. 24 (1983) 279–289.

    Google Scholar 

  12. M.Lerman, Degrees of Unsolvability, Springer-Verlag, 1983.

    Google Scholar 

  13. U. Schöning, A uniform aproach to obtain diagonal sets in complexity classes, Theor. Comput. Sci 18 (1982) 95–103.

    Google Scholar 

  14. R.I.Soare, Recursively enumerable sets and degrees, Springer-Verlag, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Oldenburg, Germany

    Klaus Ambos-Spies & Hans Fleischhack

  2. Universität Dortmund, Germany

    Hagen Huwig

Authors
  1. Klaus Ambos-Spies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Fleischhack
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hagen Huwig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Ambos-Spies, K., Fleischhack, H., Huwig, H. (1988). Diagonalizing over deterministic polynomial time. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation