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...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 52; no. 8; pp. 76 - 83
Autores principales:	MALIK, SHARAD, ZHANG, LINTAO
Formato:	Artículo
Publicado:	Association for Computing Machinery Aug2009
Materias:	Boolean algebra Computational complexity Algorithms Decision trees Computer software Computer programming
Acceso en línea:	Ver este registro en EBSCOhost