486 search results - page 1 / 98 » Improved upper bounds for 3-SAT |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
CORR
2010
Springer
14 years 9 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...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
SODA
2000
ACM
14 years 11 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
SOFSEM
2007
Springer
15 years 3 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...