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
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
403 GRASP: A search algorithm for propositional satisfiability – J P Marques-Silva, K A Sakallah - 1999
1124 A computing procedure for quantification theory – M Davis, H Putnam - 1960
513 An extensible sat-solver – N Eén, N Sörensson
3153 Graph-based algorithms for Boolean function manipulation – Randal E. Bryant - 1986
388 GRASP - A New Search Algorithm for Satisfiability – Joso L Marques Silva - 1996