Speed-up of Turing machines with one work tape and a two-way input tape
SIAM Journal on Computing
Short propositional formulas represent nondeterministic computations
Information Processing Letters
Fast simulations of time-bounded one-tape Turing machines by space-bounded ones
SIAM Journal on Computing
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape
Computational Complexity
Uniform Random Generation of Balanced Parenthesis Strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lower bounds on the complexity of recognizing SAT by turing machines
Information Processing Letters
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Time-Space Tradeoffs for Nondeterministic Computation
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Alternation and the power of nondeterminism
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Time-Space Tradeoffs in the Counting Hierarchy
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
SIMULATIONS AMONG MULTIDIMENSIONAL TURING MACHINES
SIMULATIONS AMONG MULTIDIMENSIONAL TURING MACHINES
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
A time lower bound for satisfiability
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
SIAM Journal on Computing
On Approximate Majority and Probabilistic Time
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
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
Algorithms and resource requirements for fundamental problems
Algorithms and resource requirements for fundamental problems
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
An improved time-space lower bound for tautologies
Journal of Combinatorial Optimization
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds
CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)
Hi-index | 0.00 |
A fertile area of recent research has demonstrated concrete polynomial-time lower bounds for natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, MOD6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs of these lower bounds follow a proof-by-contradiction strategy that we call resource trading or alternation trading. An important open problem is to determine how powerful such proofs can possibly be. We propose a methodology for studying these proofs that makes them amenable to both formal analysis and automated theorem proving. We prove that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances. Implementing a small-scale theorem prover based on these results, we extract new human-readable time lower bounds for several problems and identify patterns that allow for further generalization. The framework can also be used to prove concrete limitations on the current techniques.