539 search results - page 1 / 108 » An Improved Upper Bound for SAT |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...