On the Complexity of SAT

We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiability cannot be solved in time O(n 2) and poly-logarithmic space. A similar result is presented for uniform circuits.

• Type: Conference
• Year: 1999
• Where: FOCS
• Authors: Richard J. Lipton, Anastasios Viglas
• Keywords: FOCS 1999, Non-deterministic Time, Poly-logarithmic Space, Polylogarithmic Space, Theoretical Computer Science