Average time complexity of the SAT1. 2 algorithm

DOI10.1007/3-540-58325-4_176MaRDI QIDQ4525695zbMATH OpenFDO

Authors J. Gu, Qian-Ping Gu

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_176

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 30299
• Polynomial-average-time satisfiability problems
• Average polynomial time complexity of some NP-complete problems
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• The Time Complexity of Constraint Satisfaction
• Automata, Languages and Programming
• A time lower bound for satisfiability
• Algorithms for Sat and upper bounds on their complexity
• On moderately exponential time for SAT
• Average-case computational complexity theory

Cited in

(6)

• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
• Time complexity analysis of evolutionary algorithms on random satisfiable k-CNF formulas
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• scientific article; zbMATH DE number 30299 (Why is no real title available?)
• O(1.890ⁿ) exact algorithm for a class of separable SAT problems

This page was built for publication: Average time complexity of the SAT1. 2 algorithm

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