scientific article

zbMath0990.90550MaRDI QIDQ2741513

Zhao, Xishun, Hans Kleine Büning

Publication date: 24 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

propositional formulaslinear-time algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items

Community Structure Inspired Algorithms for SAT and #SAT, Are hitting formulas hard for resolution?, Solving \#SAT using vertex covers, New width parameters for SAT and \#SAT, Generalizations of matched CNF formulas, Learning to assign degrees of belief in relational domains

Cites Work

• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• A Computing Procedure for Quantification Theory