The Complexity of Automated Reasoning (1989)

by André Vellino
Citations:9 - 0 self

Documents Related by Co-Citation

1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
264 The intractability of resolution – A Haken - 1985
51 Resolution vs. cutting plane solution of inference problems: Some computational experience – J Hooker - 1988
42 Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem – J Franco, M Paull - 1983
775 The complexity of theorem-proving procedures – Stephen A. Cook - 1971
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962
214 Many hard examples for resolution – V Chvátal, E Szemerédi - 1988
148 P.: Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method – S Minton, M Johnston, A Philips, Laird - 1990
516 Optimization by simulated annealing: An experimental evaluation, Part – D S JOHNSON, C R ARAGON, L A MCGEOCH, C SCHEVON - 1991
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
19 Unrestricted resolution versus N-resolution – A Goerdt - 1992
4 Zur Effizienz der Beweissuche in der Logikverarbeitung – Ulf Dunker - 1997
10 Homogenization and the Polynomial Calculus – Josh Buresh-Oppenheim, Matt Clegg, Russell Impagliazzo, Toniann Pitassi - 1999
46 A Study of Proof Search Algorithms for Resolution and Polynomial Calculus – Maria Luisa Bonet, Nicola Galesi - 1999
167 A Machine Oriented Logic Based on the Resolution Principle – J A Robinson - 1965
28 Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems – Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi - 1998
22 Size Space tradeoffs for Resolution – Eli Ben-Sasson - 2002
25 Regular resolution versus unrestricted resolution – Andreas Goerdt - 1993