Sciweavers

CP
2000
Springer
14 years 3 months ago
Algebraic Simplification Techniques for Propositional Satisfiability
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...
João P. Marques Silva