Boolean satisfiability from theoretical hardness to practical success
Year: 2009
Type: article
Source: Communications of the ACM
Authors: Sharad Malik, Lintao Zhang
Institutions: Princeton University, Microsoft Research Asia (China)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1999396796
