A fast algorithm for SAT in terms of formula length

DOI10.1007/978-3-030-80223-3_30OpenAlexW3185616850MaRDI QIDQ2118334

Mingyu Xiao, Junqiang Peng

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2105.06131

zbMATH Keywords

satisfiabilityparameterized algorithmsmeasure-and-conquer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (1)

Further improvements for SAT in terms of formula length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact exponential algorithms.
• A satisfiability tester for non-clausal propositional calculus
• New worst-case upper bounds for SAT
• An Improved SAT Algorithm in Terms of Formula Length
• A measure & conquer approach for the analysis of exact algorithms
• Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT
• Algorithms – ESA 2005
• A Computing Procedure for Quantification Theory
• The complexity of theorem-proving procedures
• Theory and Applications of Satisfiability Testing
• Algorithms and Computation
• On the complexity of \(k\)-SAT

This page was built for publication: A fast algorithm for SAT in terms of formula length