Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Fahiem Bacchus:

TR03-003 | 19th December 2002
Fahiem Bacchus, Shannon Dalmao

DPLL with Caching: A new algorithm for #SAT and Bayesian Inference

Bayesian inference and counting satisfying assignments are important
problems with numerous applications in probabilistic reasoning. In this
paper, we show that plain old DPLL equipped with memoization can solve
both of these problems with time complexity that is at least as
good as all known algorithms. Furthermore, DPLL with memoization
more >>>

ISSN 1433-8092 | Imprint