<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-10-28 07:18:32Theoretical computer science Mathematics Formal methods Constraint programming Boolean algebra Automated theorem proving DPLL algorithm Binary decision diagram Exponential time hypothesis Computational complexity theory Bayesian network Distribution |
Add to Reading List |
Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck![Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk](https://www.pdfsearch.io/img/cbcd436a821e21d4f5e4c96ed2bbe799.jpg "Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk")
