P-generic sets
- 1 January 1984
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- P-mitotic setsLecture Notes in Computer Science, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Recursively enumerable generic setsThe Journal of Symbolic Logic, 1982
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975