Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We make several improvements on time lower bounds for concrete problems in NP and PH. 1. We present an elementary technique based on "indirect diagonalization" that uniformly improves upon the known nonlinear time lower bounds for nondeterminism and alternating computation, on both sublinear (n驴驴鹿驴) space RAMs and sequential worktape machines with random access to the input. We obtain better lower bounds for SAT, as well as all NP-complete problems that have efficient reductions from SAT, and 驴_k-SAT, for constant k驴 2. For example, SAT cannot be solved by random access machines using n^{\sqrt 3 } time and n驴驴鹿驴 space. The technique is a natural inductive approach, for which previous work is essentially its base case. 2. We show how indirect diagonalization can also yield time-space lower bounds for computation with bounded nondeterminism. One corollary is that for all k, there exists a constant c_k 1 such that satisfiability of Boolean circuits with n inputs and n^k gates cannot be solved in deterministic time n^{k \cdot c_k }and n驴驴鹿驴 space.