Sciweavers

159 search results - page 4 / 32
» On the Complexity of SAT
Sort
View
FOCS
2003
IEEE
14 years 1 months ago
Algorithms and Complexity Results for #SAT and Bayesian Inference
Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
COCO
2003
Springer
98views Algorithms» more  COCO 2003»
14 years 1 months ago
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Chris Calabro, Russell Impagliazzo, Valentine Kaba...
FOCS
1999
IEEE
14 years 25 days ago
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) satisfiabi...
Richard J. Lipton, Anastasios Viglas
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
14 years 2 months ago
Hardness of Max 3SAT with No Mixed Clauses
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
Venkatesan Guruswami, Subhash Khot