|
|
On the Occurrence of Null Clauses in Random Instances of Satisfiability
– John Franco Department, John Franco
- 1989
|
|
9
|
Average Case Results for Satisfiability Algorithms Under the Random Clause Width Model
– J. Franco, R.P. Swaminathan
- 1995
|
|
6
|
Backtracking and Probing
– Paul Walton Purdom, Jr., G. Neil Haven
- 1993
|
|
107
|
Algorithms for the Satisfiability (SAT) Problem: A Survey
– Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
- 1996
|
|
2
|
Probe Order Backtracking
– Paul Walton Purdom, Jr. G. Neil Haven
- 1997
|
|
10
|
Probabilistic Performance of a Heuristic for the Satisfiability Problem
– John Franco, Yuan Chuan Ho
- 1986
|
|
|
Some Interesting Research Directions in Satisfiability
– John Franco
- 2000
|
|
16
|
Breadth first search 3SAT algorithms for DNA computers
– Mitsunori Ogihara
- 1996
|
|
5
|
The Probability of Pure Literals
– John W. Rosenthal, J. M. Plotkin
|
|
101
|
Finding Hard Instances of the Satisfiability Problem: A Survey
– Stephen A. Cook, David G. Mitchell
- 1997
|
|
79
|
Probabilistic Analysis Of A Generalization Of The Unit Clause Literal Selection Heuristic For The K-Satisfiability Problem
– Min-te Chao, John Franco
- 1990
|
|
2
|
Convergence Properties of Optimization Algorithms for the Satisfiability (SAT) Problem
– Jun Gu, Qian-ping Gu, Ding Zhu Du
- 1996
|
|
8
|
DNA-Based Parallel Computation by "Counting"
– Mitsunori Ogihara, Animesh Ray
- 1997
|
|
17
|
Global Optimization for Satisfiability (SAT) Problem
– Jun Gu
- 1994
|
|
|
Gedanken: A tool for pondering the tractability of correct program technology
– Lars Warren Ericson, Prof Bhubaneswar Mishra, C Lars Warren Ericson
- 1994
|
|
1
|
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
– Ke Xu, Wei Li, Ke Xu#and#wei Li
- 2001
|
|
15
|
Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems
– William Spears, Kenneth A. De Jong
- 1983
|
|
18
|
Some Pitfalls for Experimenters with Random SAT
– David G. Mitchell, Hector J. Levesque
- 1996
|
|
5
|
Theoretical analysis of DavisPutnam procedure and propositional satisfiability
– Nobuhiro Yugami
- 1995
|
