344 search results - page 30 / 69 » The Santa Claus problem |
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
SAT
2009
Springer
14 years 4 months ago
2009
Springer
The concept of backdoor variables has been introduced as a structural property of combinatorial problems that provides insight into the surprising ability of modern satisfiability...
TABLEAUX
1999
Springer
14 years 2 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
PLILP
1998
Springer
14 years 2 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
CADE
1997
Springer
14 years 1 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...