Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

FOCS
1999
IEEE

favoriteEmaildiscussreport

103views Theoretical Computer Science» more FOCS 1999»

On the Complexity of SAT

13 years 8 months ago

On the Complexity of SAT

Download www.it.usyd.edu.au

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.

Richard J. Lipton, Anastasios Viglas

Real-time Traffic

FOCS 1999 | Non-deterministic Time | Poly-logarithmic Space | Polylogarithmic Space | Theoretical Computer Science |

claim paper

Related Content

» Mapping Problems with FiniteDomain Variables into Problems with Boolean Variables

» QuteSAT a robust circuitbased SAT solver for complex circuit structure

» A SATbased solver for QALL SAT

» The parameterized complexity of kflip local search for SAT and MAX SAT

» Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

» The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions

» The Complexity of Making Unique Choices Approximating 1in k SAT

» Let the Solver Deal with Redundancy

» A Note on the Use of Independent Sets for the kSAT Problem

» Human computing for EDA

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Richard J. Lipton, Anastasios Viglas

Comments (0)