A time lower bound for satisfiability

@article{Melkebeek2004ATL,
  title={A time lower bound for satisfiability},
  author={Dieter van Melkebeek and Ran Raz},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={348},
  pages={311-320}
}

Figures from this paper

Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas

  • Ryan Williams
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2008
TLDR
This work gives a reduction from arbitrary languages in alternating time t(n) to QBFs describable in O(t(n)) bits by a reasonable (polynomially) succinct encoding, and proves that the succinct QBF problem requires superlinear time on those models.

Inductive Time-Space Lower Bounds for Sat and Related Problems

  • Ryan Williams
  • Computer Science, Mathematics
    computational complexity
  • 2007
TLDR
It is proved that for all k ≥ 1, there is a constant ck > 1 such that linear time with n1/k nondeterministic bits is not contained in deterministic time, used to prove that satisfiability of Boolean circuits with n inputs and nk size cannot be solved by deterministic multitape Turing machines.

One-Tape Turing Machine and Branching Program Lower Bounds for MCSP

TLDR
These results are the first non-trivial lower bounds for MCSP and MKTP against one-tape Turing machines and non-deterministic branching programs, and essentially match the best-known lower bound for any explicit functions against these computational models.

Pseudorandom bits and lower bounds for randomized Turing machines

  • Emanuele Viola
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2019
TLDR
A pseudorandom generator with nearly quadratic stretch for randomized Turing machines, which have a one-way random tape and a two-way work tape, and is used to prove a time lower bound for a function computable in linear time with two quantifier alternations.

Algorithms and resource requirements for fundamental problems

TLDR
It is proved that the Boolean satisfiability problem and other hard problems require Ω(n2cos(π/7)- o(1)) ≥Ω( n1.801) time to solve by any algorithm that uses no(1) space, and more efficient methods for solving interesting classes of NP-hard problems exactly are established.

Automated Proofs of Time Lower Bounds

TLDR
It is proved that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances, and an automated theorem-proving methodology is proposed for studying these lower bound problems.

Better time-space lower bounds for SAT and related problems

  • Ryan Williams
  • Computer Science
    20th Annual IEEE Conference on Computational Complexity (CCC'05)
  • 2005
TLDR
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 space RAMs and sequential worktape machines with random access to the input.

Time-space lower bounds for satisfiability

We establish the first polynomial time-space lower bounds for satisfiability on general models of computation. We show that for any constant <i>c</i> less than the golden ratio there exists a

On Approximate Majority and Probabilistic Time

  • Emanuele Viola
  • Computer Science, Mathematics
    Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
  • 2007
TLDR
It is proved that depth-3 circuits with bottom fan-in (log n)/2 that compute approximate majority on n bits must have size at least 2 n 0.1, and there is no black-box proof that BPTime (t) is computable by uniform polynomial-size circuits of depth 3.

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

TLDR
It is proved that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances, and new human-readable time lower bounds for several problems are extracted.

References

SHOWING 1-10 OF 17 REFERENCES

Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape

TLDR
A matching lower bound is proved which holds for the problem of recognizing languages on machines with a separate one-way input tape for Turing machines using one d-dimensional work tape.

Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape

We prove a \(\Theta (t(n)\sqrt[d]{{t(n)}}/\log i(n))\) bound for the simulation of t(n) steps of a Turing machine using several one-dimensional work tapes on a Turing machine using one d-dimensional

On the complexity of SAT

  • R. LiptonAnastasios Viglas
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
We show that non-deterministic time NTIME(n) is not contained in deterministic time n/sup 2-/spl epsiv// and polylogarithmic space, for any /spl epsiv/>0. This implies that (infinitely often),

A hierarchy for nondeterministic time complexity

  • S. Cook
  • Computer Science
    J. Comput. Syst. Sci.
  • 1973
TLDR
For any real numbers r1, r2, 1 ≤ r1 < r2 , there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterdependencies nr1, and the computing devices are non-deterministic multitape Turing machines.

Two tapes versus one for off-line Turing machines

We prove the first superlinear lower bound for a concrete, polynomial time recognizable decision problem on a Turing machine with one work tape and a two-way input tape (also called off-line 1-tape

Time-Space Tradeoffs for Satisfiability

  • L. Fortnow
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 2000
TLDR
It is shown that SAT cannot be solved in n1+o(1) time and n1?? space for any general random-access nondeterministic Turing machines, and lower bounds for log-space uniform NC1 circuits and branching programs are given.

Short Propositional Formulas Represent Nondeterministic Computations

  • S. Cook
  • Computer Science
    Inf. Process. Lett.
  • 1988

Time-space tradeoffs for nondeterministic computation

  • L. FortnowD. Melkebeek
  • Computer Science
    Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
TLDR
In general, for any constant a less than the golden ratio, it is proved that satisfiability cannot be solved in time n/sup a/ and space n/Sup /spl delta// for some positive constant b.

Time-space lower bounds for satisfiability

We establish the first polynomial time-space lower bounds for satisfiability on general models of computation. We show that for any constant <i>c</i> less than the golden ratio there exists a

One-Tape, Off-Line Turing Machine Computations