264 search results - page 1 / 53 » On the possibility of faster SAT algorithms |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We present an algorithm that decides the satisfiability of a
DATE
2009
IEEE
13 years 11 months ago
2009
IEEE
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
DISOPT
2011
12 years 12 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
WDAG
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...