![Automated theorem proving / NP-complete problems / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Resolution / Unit propagation / Constraint satisfaction / Theoretical computer science / Mathematics / Applied mathematics Automated theorem proving / NP-complete problems / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Resolution / Unit propagation / Constraint satisfaction / Theoretical computer science / Mathematics / Applied mathematics](/pdf-icon.png) Date: 2008-10-23 11:39:06Automated theorem proving NP-complete problems Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Resolution Unit propagation Constraint satisfaction Theoretical computer science Mathematics Applied mathematics | | The Phase Transition in Exact Cover Vamsi Kalapala∗ and Cristopher Moore∗,† {vamsi,moore}@cs.unm.edu, ∗ Department of Computer Science, University of New MexicoAdd to Reading ListSource URL: cjtcs.cs.uchicago.eduDownload Document from Source Website File Size: 123,91 KBShare Document on Facebook
|