Cover Image
QR Code

Boolean Satisfiability: From Theoretical Hardness to Practical Success.

The article presents a discussion of topics in computer science related to Boolean satisfiability. It focuses on solutions which can be readily used in applications software, and their effectiveness for solving certain types of problems. Topics addressed include the interaction between necessary val...

Full description

Published in:Communications of the ACM Vol. 52; no. 8; pp. 76 - 83
Main Authors: MALIK, SHARAD, ZHANG, LINTAO
Format: Article
Published: Association for Computing Machinery Aug2009
Subjects:
Boolean algebra
Computational complexity
Algorithms
Decision trees
Computer software
Computer programming
Online Access:View this record in EBSCOhost