Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
Homer, S. and W. Maass, Oracle dependent properties of the lattice of NP-sets, TCS 24(1983) 279–289
Jockusch, C., Notes on genericity for r.e. sets, handwritten notes.
Ladner, R.E., Lynch, N.A., and Selman, A.L., A comparison of polynomial time reducibilities, TCS 1 (1975) 103–123.
Maass, W., Recursively enumerable generic sets, J.Symb.Logic 47 (1982) 809–823.
Selman, A.L., P-selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP, Math. Systems Theory 13 (1979) 55–65.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambos-Spies, K., Fleischhack, H., Huwig, H. (1984). P-generic sets. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive