We introduce the notion of a p-generic set. P-generic sets automatically have all properties which can be enforced by usual diagonalizations over polynomial time computable sets and functions. We prove that there are recursive — in fact exponential time computable — p-generic sets. The existence of p-generic sets in NP is shown to be oracle dependent, even under the assumption that P ≠ NP.
Unable to display preview. Download preview PDF.
- Ambos-Spies,K., P-mitotic sets, in: E.Börger, G.Hasenjaeger and D.Rödding, Eds., Logic and machines: Decision problems and complexity, SLNCS (to appear in 1984). Preprint: Techn. Report Nr. 167 (1983) Universität Dortmund.Google Scholar
- Ambos-Spies,K., Fleischhack,H., and Huwig,H., Diagonalizations over polynomial time computable sets, submitted for publication. Preprint: Techn. Report Nr. 177 (1984) Universität Dortmund.Google Scholar
- Benett, C.H. and J. Gill, Relative to a random oracle A,PA≠NPA≠CO-NPA with probability 1, SIAM Comp. 10 (1981) 96–113.Google Scholar
- Homer, S. and W. Maass, Oracle dependent properties of the lattice of NP-sets, TCS 24(1983) 279–289Google Scholar
- Jockusch, C., Notes on genericity for r.e. sets, handwritten notes.Google Scholar
- Ladner, R.E., Lynch, N.A., and Selman, A.L., A comparison of polynomial time reducibilities, TCS 1 (1975) 103–123.Google Scholar
- Maass, W., Recursively enumerable generic sets, J.Symb.Logic 47 (1982) 809–823.Google Scholar
- Selman, A.L., P-selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP, Math. Systems Theory 13 (1979) 55–65.Google Scholar