Elimination Of Infrequent Variables Improves Average Case Performance Of Satisfiability Algorithms (1991)


Download Links

by John Franco
Venue:SIAM J. Comput
Citations:16 - 5 self

Active Bibliography

126 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
9 Average Case Results for Satisfiability Algorithms Under the Random Clause Width Model – J. Franco, R.P. Swaminathan - 1995
On the Occurrence of Null Clauses in Random Instances of Satisfiability – John Franco Department, John Franco - 1989
6 Backtracking and Probing – Paul Walton Purdom, Jr., G. Neil Haven - 1993
4 Probe order backtracking – P Purdom, G N Haven - 1997
3 Average Time for the Full Pure Literal Rule – Paul Walton Purdom, Jr.
1 ASimple Test Improves Checking Satisfiability – Eliezer L. Lozinskii
12 Probabilistic Performance of a Heuristic for the Satisfiability Problem – John Franco, Yuan Chuan Ho - 1986
Probabilistic Analysis of Satisfiability Algorithms – John Franco - 2008