Reducing the size of resolution proofs in linear time

Efficient Conflict Driven Learning in a Boolean Satisfiability Solver

2001 · 666 citations

Computing, Computer Science, Algorithms +11

A fast algorithm for finding dominators in a flowgraph

Thomas Lengauer, Robert E. Tarjan · ACM Transactions on Programming Languages and Systems · 1979 · 632 citations

Computing, Computer Science, Algorithms +12

Conflict driven learning in a quantified Boolean Satisfiability solver

Lintao Zhang, Sharad Malik · Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design · 2002 · 235 citations

Computing, Computer Science, Algorithms +11

The Complexity of Propositional Proofs

Alasdair Urquhart · Bulletin of Symbolic Logic · 1995 · 225 citations

Computing, Computer Science, Mathematics +16

The complexity of facets resolved

Christos H. Papadimitriou, David Wolfe · Journal of Computer and System Sciences · 1988 · 207 citations · Full text

Computing, Computer Science, Algorithms +9