BerkMin: a fast and robust sat-solver (2002)

by Evgueni Goldberg , Yakov Novikov
Citations:272 - 5 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
1206 Chaff: Engineering an Efficient SAT Solver – Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik - 2001
1124 A computing procedure for quantification theory – M Davis, H Putnam - 1960
388 GRASP - A New Search Algorithm for Satisfiability – Joso L Marques Silva - 1996
773 A machine program for theorem proving – M Davis, G Longemann, D Loveland - 1962
770 Symbolic Model Checking without BDDs – Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu - 1999
573 A machine program for theoremproving – Martin Davis, George Logemann, Donald Loveland - 1962
305 Efficient Conflict Driven Learning in a Boolean Satisfiability Solver – Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - 2001
331 Boosting combinatorial search through randomization – Carla P. Gomes - 1998