P-Selectivity, Immunity, and the Power of One Bit
Lane A. Hemaspaandra, Leen Torenvliet
Abstract
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 Π2p/1-immune.
Create a lesson
Related papers
Pseudodeterminism and MA != NPBPP in Communication Complexity
Thomas Watson
Group Isomorphism and the Polylogarithmic-Time Hierarchy: Depth-212 Circuits and Lower Bounds
Joshua A. Grochow, Gülce Kardeş, Michael Levet
Continuous Computational Social Choice: A Case Study in Bribery
Martin Koutecký, Nikolaos Melissinos, Tung Anh Vu et al.
Pseudorandom Functions in NC1 from LWE/LPN/CDH (Or: How to Build PRFs in NC1, Generically)
Youlong Ding, Aayush Jain, Ilan Komargodski
Parameterized Complexity of Lp-Lipschitz Constants for Input Convex Neural Networks and Lp-Norm Maximization over Zonotopes
Aritra Das, Vincent Froese, Moritz Grillo et al.
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan