Immunity, relativizations, and nondeterminism
SIAM Journal on Computing
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
Theoretical Computer Science
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
SIAM Journal on Computing
The complexity theory companion
The complexity theory companion
Theory of Semi-Feasible Algorithms
Theory of Semi-Feasible Algorithms
ACM SIGACT News
Probability One Separation of the Boolean Hierarchy
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Algebraic Properties for Selector Functions
SIAM Journal on Computing
The Complexity of Finding Top-Toda-Equivalence-Class Members
Theory of Computing Systems
On the structure of complete sets: Almost everywhere complexity and infinitely often speedup
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Open questions in the theory of semifeasible computation
ACM SIGACT News
Theoretical Computer Science
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is not EXP/1-immune. That is, we prove that some infinite P-selective set has no infinite EXP-time subset, but we also prove that every infinite P-selective set has some infinite subset in EXP/1. Informally put, the immunity of P-sel is so fragile that it is pierced by a single bit of information. The above claims follow from broader results that we obtain about the immunity of the P-selective sets. In particular, we prove that for every recursive function f, P-sel is DTIME(f)-immune. Yet we also prove that P-sel is not ${\it \Pi}^{p}_{2}$/1-immune.