O(1.890ⁿ) exact algorithm for a class of separable SAT problems

DOI10.13328/J.CNKI.JOS.005378MaRDI QIDQ5381999zbMATH OpenOpenAlexFDO

Authors Jingui Huang, Shengchun Wang

Publication date 21 June 2019

Full work available at URL http://www.jos.org.cn/jos/ch/reader/view_abstract.aspx?flag=1&file_no=5378&journal_id=jos

zbMATH Keywords

algorithm complexityexact algorithmNP-complete problemregular separabilitysatisfiability problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• New algorithms for exact satisfiability
• scientific article; zbMATH DE number 515744
• scientific article; zbMATH DE number 1555929
• Algorithms – ESA 2005
• Theory and Applications of Satisfiability Testing

This page was built for publication: $O(1.890^n)$ exact algorithm for a class of separable SAT problems

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