This paper presents the first precise characterization of clause learning as a proof system, and begins the task of understanding its power by relating it to the well-studied resolution proof system.Expand

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set, including both static and dynamic predecessor problems, in a much stronger communication game model.Expand

We integrate component caching with clause learning, one of the most important ideas used in modern SAT solvers, and show how this combination can be achieved so as to obtain the performance improvements just mentioned.Expand

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed efficiently stored set.Expand

This paper begins to investigate the question of whether "compilation to model-counting" could be a practical technique for solving real-world #P-complete problems, in particular Bayesian inference.Expand

A highly-tuned version of Cachet, the first (and currently, only) system able to exactly determine the marginal probabilities of variables in random 3-SAT formulas with 150+ variables.Expand

We study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with $p$ servers.Expand

We consider the problem of finding a maximal independent set in an independence system quickly in parallel when the independence system is presented as an explicit list of minimal dependent sets, and provide an algorithm which we conjecture is a randomized NC algorithm for the general case.Expand