159 search results - page 4 / 32 » On the Complexity of SAT |
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
121
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
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...
129
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
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 ...