20 search results - page 1 / 4 » Proving Termination with (Boolean) Satisfaction |
87
Voted
LOPSTR
2007
Springer
15 years 7 months ago
2007
Springer
102
click to vote
JUCS
2007
15 years 29 days ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
112
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
126
Voted
ECCC
2010
15 years 1 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
125
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...