• Publications
  • Influence
Towards Understanding and Harnessing the Potential of Clause Learning
TLDR
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
  • 293
  • 30
  • PDF
Optimal Bounds for the Predecessor Problem and Related Problems
  • P. Beame, F. Ellen
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1 August 2002
TLDR
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
  • 171
  • 30
  • PDF
Combining Component Caching and Clause Learning for Effective Model Counting
TLDR
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
  • 213
  • 26
  • PDF
Communication steps for parallel query processing
TLDR
We consider the problem of computing a relational query q on a large input database of size n, using a large number p of servers. Expand
  • 204
  • 24
  • PDF
Optimal bounds for the predecessor problem
TLDR
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
  • 101
  • 18
  • PDF
Skew in parallel query processing
TLDR
We study the problem of computing a conjunctive query q in parallel, using p of servers, on a large database where the data is skewed. Expand
  • 111
  • 17
  • PDF
Performing Bayesian Inference by Weighted Model Counting
TLDR
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
  • 199
  • 15
  • PDF
Heuristics for Fast Exact Model Counting
TLDR
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
  • 83
  • 13
  • PDF
Parallel search for maximal independence given minimal dependence
TLDR
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
  • 33
  • 12
Simplified and improved resolution lower bounds
  • P. Beame, T. Pitassi
  • Mathematics, Computer Science
  • Proceedings of 37th Conference on Foundations of…
  • 14 October 1996
TLDR
We give simple new lower bounds on the lengths of resolution proofs for the pigeonhole principle and for randomly generated formulas. Expand
  • 198
  • 11
  • PDF