1084

A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
 1960

742

A machine program for theorem proving
– Martin Davis, George Logemann, Donald Loveland
 1962

31

CNFsatisfiability test by counting and polynomial average time
– K Iwama
 1989

28

The pure literal rule and polynomial average time
– P W Purdom Jr, C A Brown
 1985

11

Exponential average time for the pure literal rule
– K M Bugrara, Y F Pan, P Purdom
 1989

80

Search rearrangement backtracking and polynomial average time
– P W Purdom
 1983

78

Report on a SAT competition
– Buro Kleine Buning, Reihe Informatik, Michael Buro, Hans Kleine Buning
 1993

24

Average time analysis of simplified davisputnam procedures
– A Goldberg, P W Purdom, C Brown
 1982

7

On the occurrence of null clauses in random instances of satisfiability
– J Franco
 1993

18

An Average Time Analysis of Backtracking
– P Purdom, C Brown
 1981

775

The complexity of theoremproving procedures
– Stephen A. Cook
 1971

24

On the Probabilistic Performance of Algorithms for the Satisfiability Problem
– J FRANCO
 1986

311

J.H.: Lineartime algorithms for testing the satisfiability of propositional Horn formulae
– W F Dowling, Gallier
 1984

30

On the complexity of the satisfiability problem
– A Goldberg
 1979

90

On the satisfiability and maximum satisfiability of random 3CNF formulas
– A Z Broder, A M Frieze, E Upfal
 1996

66

Probabilistic analysis of the DavisPutnam procedure for solving the satisfiability problem
– J Franco, M Paull
 1983

25

Average Case Complexity of the Satisfiability Problem
– A Goldberg
 1979

6

Backtracking and Probing
– Paul Walton Purdom, Jr., G. Neil Haven
 1993

10

A Survey of Average Time Analyses of Satisfiability Algorithms
– P PURDOM
 1990
