![NP-complete problems / Automated theorem proving / Constraint programming / Boolean algebra / Formal methods / DPLL algorithm / Boolean satisfiability problem / Conjunctive normal form / Lookup table / Theoretical computer science / Applied mathematics / Mathematics NP-complete problems / Automated theorem proving / Constraint programming / Boolean algebra / Formal methods / DPLL algorithm / Boolean satisfiability problem / Conjunctive normal form / Lookup table / Theoretical computer science / Applied mathematics / Mathematics](https://www.pdfsearch.io/img/244ff64cede00a537659e34af9697977.jpg) Date: 2004-04-13 00:26:28NP-complete problems Automated theorem proving Constraint programming Boolean algebra Formal methods DPLL algorithm Boolean satisfiability problem Conjunctive normal form Lookup table Theoretical computer science Applied mathematics Mathematics | | Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of WashingtoAdd to Reading ListSource URL: www.cs.toronto.eduDownload Document from Source Website File Size: 91,28 KBShare Document on Facebook
|