5138 search results - page 16 / 1028 » Randomized Algorithms for 3-SAT |
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
SAT
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
SODA
2012
ACM
12 years 5 days ago
2012
ACM
IDEAS
2007
IEEE
14 years 4 months ago
2007
IEEE
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
JAIR
2007
13 years 9 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...