scientific article; zbMATH DE number 30299

MaRDI QIDQ3985347zbMATH OpenFDO

Authors Paul Walton jun. Purdom

Publication date 27 June 1992

zbMATH Keywords

asymptotic analysesrandom problemsalgorithms for satisfiability problemsaverage number of nodes per problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Polynomial-average-time satisfiability problems
• An exact and a randomized approach for the satisfiability problem
• scientific article; zbMATH DE number 1113993
• Exponential Average Time for the Pure Literal Rule
• scientific article; zbMATH DE number 1555929

Cited in

(13)

• Typical case complexity of satisfiability algorithms and the threshold phenomenon
• Some pitfalls for experimenters with random SAT
• An exact and a randomized approach for the satisfiability problem
• A BDD SAT solver for satisfiability testing: An industrial case study
• Exponential Average Time for the Pure Literal Rule
• Solving the satisfiability problem by using randomized approach
• scientific article; zbMATH DE number 1555929 (Why is no real title available?)
• Running time experiments on some algorithms for solving propositional satisfiability problems
• Polynomial-average-time satisfiability problems
• Generating hard satisfiability problems
• Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures
• Backtracking tactics in the backtrack method for SAT
• A weight-balanced branching rule for SAT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985347)