scientific article; zbMATH DE number 1444322

MaRDI QIDQ4953355zbMATH OpenFDO

Authors Ying Teh Tsai, Chuan Yi Tang

Publication date 9 May 2000

zbMATH Keywords

\(k\)-satisfiability problem

Mathematics Subject Classification ID

Recommendations

• A probabilistic algorithm for k-SAT based on limited local search and restart
• Solving satisfiability in less than \(2^ n\) steps
• Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
• scientific article; zbMATH DE number 30299
• CNF-Satisfiability Test by Counting and Polynomial Average Time

Cited in

(3)

• Complete on average Boolean satisfiability
• Satisfiability algorithm for syntactic read-\(k\)-times branching programs
• Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances

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 Q4953355)