Sciweavers

COCO
2003
Springer
102views Algorithms» more  COCO 2003»
14 years 27 days ago
Memoization and DPLL: Formula Caching Proof Systems
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
Paul Beame, Russell Impagliazzo, Toniann Pitassi, ...