Home → Magazine Archive → August 2009 (Vol. 52, No. 8) → Boolean Satisfiability: From Theoretical Hardness... → Abstract

Boolean Satisfiability: From Theoretical Hardness to Practical Success

By Sharad Malik, Lintao Zhang

Communications of the ACM, Vol. 52 No. 8, Pages 76-82
10.1145/1536616.1536637

[article image]


Satisfiability solvers can now be effectively deployed in practical applications.

The full text of this article is premium content

0 Comments

No entries found