Franco, J. (1986). Probabilistic analysis of algorithms for NP-complete problems. United States Air Force Annual Scientific Report, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Hard Satisfiability Problems - Selman, Mitchell, Levesque (1996) (60 citations) (Correct)
....overly optimistic. Goldberg s formulas were so easily satisfiable that an algorithm which simply tried randomly generated assignments would, with probability 1, finds a satisfying assignment in a constant number of guesses. Further analytic results for the constant density model can be found in Franco (1986), Franco and Ho (1988) and Purdom and Brown (1987) Franco and Paull (1983) also investigated the performance of DP on random formulas with a fixed clause length of 3, and suggested that it might be more useful for generating random instances, an hypothesis we have confirmed experimentally here. ....
Franco, J. (1986). Probabilistic analysis of algorithms for NP-complete problems. United States Air Force Annual Scientific Report, 1986.
Hard and Easy Distributions of SAT Problems - Mitchell, Selman, Levesque (1992) (298 citations) (Correct)
....optimistic. Goldberg s formulas were so easily satisfiable that an algorithm which simply tried randomly generated assignments would, with probability 1, find a satisfying assignment in a constant number of guesses. Further analytic results for the constant probability model can be found in Franco (1986), Franco and Ho (1988) Franco and Paull (1983) also investigated the performance of DP on random 3 SAT, and suggested that it might be more useful for generating random instances, an hypothesis we have confirmed experimentally here. They showed that for any fixed ratio of clauses to variables, if ....
....of DP can be explained by the fact that they tend to have very many satisfying truth assignments a fact we have verified experimentally so that the proce dure almost always finds one early in the search. Other analytic results for random 3 SAT are reviewed in Chao and Franco (1990) and Franco (1986). Not only are our experimental results consistent with the analytic results, they also provide a more finegrained picture of how 3 SAT may behave in practice. One reason for the limitations of analytic results is the complexity of the analyses required. Another is that they are asymptotic, i.e. ....
Franco, J. (1986). Probabilistic analysis of algorithms for NP-complete problems. United States Air Force Annual Scientific Report, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC