Skip to main content
SpringerLink
Log in

P-genericity and strong p-genericity

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

Abstract

We discuss some differences between p-generic and strongly p-generic sets. While the class of p-generic sets has measure 1, the class of strongly p-generic sets has measure 0 in an appropriate measure space. Also contrasting the situation with the p-generic sets, for no oracle A, NP(A) contains a strongly p-generic set. Moreover, the notion of np-genericity is introduced and strong p-genericity is shown to be even stronger than np-genericity.

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. Ambos-Spies, K., Fleischhack, H., and Huwig, H., P-generic sets, in "Automata, Languages and Programming", LNCS 172 (1984), 58–68.

    Google Scholar 

  2. Ambos-Spies, K.,Fleischhack, H., and Huwig, H., Diagonalizations over polynomial time computable sets, Forschungsbericht Nr. 177 (1984), Abteilung Informatik, Universität Dortmund.

    Google Scholar 

  3. Ambos-Spies, K., P-mitotic sets, in "Logic and machines: Decision problems and complexity", LNCS 171 (1984), 1–23.

    Google Scholar 

  4. Bennet, C., and Gill, J., Relative to a random oracle A, pA ≠ NPA ≠ co-NPA with probability 1, SIAM J. Comp. 10 (1981), 96–113.

    Google Scholar 

  5. Fleischhack, H., On diagonalizations over complexity classes, Dissertation, Dortmund 1985.

    Google Scholar 

  6. Halmos, P., Measure Theory, Springer, New York, 1950.

    Google Scholar 

  7. Homer, S., and Maass, W., Oracle dependent properties of the lattice of NP-sets, TCS 24 (1983), 279–289.

    Google Scholar 

  8. Jockusch, C., Notes on genericity for r. e. sets, unpublished, 1983.

    Google Scholar 

  9. Maass, W., Recursively enumerable generic sets, JSL (1982), 809–823.

    Google Scholar 

  10. Mehlhorn, K., On the size of sets of computable functions, Techn. Rep. 72–164, Ithaca, New York, 1973.

    Google Scholar 

  11. Mehlhorn, K., The ‘almost all’ theory of subrecursive degrees is decidable, Tech. Rep. 73–170, Ithaca, New York, 1973.

    Google Scholar 

  12. Selman, A., P-selective sets, tally languages and the behaviour of polynomial time reducibilities on NP, Math. Systems Theory 13 (1979), 55–65.

    Google Scholar 

  13. Willard, S., General topology, Addison-Wesley, Reading, Mass., 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Oldenburg, Germany

    Hans Fleischhack

Authors
  1. Hans Fleischhack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischhack, H. (1986). P-genericity and strong p-genericity. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016258

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation