scientific article
From MaRDI portal
Publication:3985347
zbMath0768.68057MaRDI QIDQ3985347
Publication date: 27 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random problemsasymptotic analysesalgorithms for satisfiability problemsaverage number of nodes per problem
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
A weight-balanced branching rule for SAT ⋮ A BDD SAT solver for satisfiability testing: An industrial case study ⋮ Generating hard satisfiability problems ⋮ Some pitfalls for experimenters with random SAT ⋮ Solving the satisfiability problem by using randomized approach ⋮ Backtracking tactics in the backtrack method for SAT
