17 search results - page 4 / 4 » A spectral technique for random satisfiable 3CNF formulas |
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...