2 search results - page 1 / 1 » Algebraic Simplification Techniques for Propositional Satisf... |
CP
2000
Springer
13 years 8 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
COMBINATORICS
2004
13 years 4 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...