Exploiting SAT solvers in unbounded model checking K. L. McMillan Cadence Berkeley Labs.
On Solving Presburger and Linear Arithmetic with SAT Ofer Strichman Carnegie Mellon University.
Using Problem Structure for Efficient Clause Learning Ashish Sabharwal, Paul Beame, Henry Kautz University of Washington, Seattle April 23, 2003.
Deciding Equality with Uninterpreted Functions using Congruence Closure Constantinos Bartzis.
Discrete Structures & Algorithms The P vs. NP Question EECE 320.
Weizmann Institute Tuning SAT-checkers for Bounded Model-Checking A bounded guided tour Ofer Shtrichman Weizmann Institute & IBM (HRL)
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
Complexity Theory: The P vs NP question Lecture 28 (Dec 4, 2007)
CSE 589 Applied Algorithms Spring 1999 3-Colorability Branch and Bound.
