一类可分离SAT问题的O(1.890 n )精确算法

DOI10.13328/J.CNKI.JOS.005378zbMath1424.68150OpenAlexW2905254837MaRDI QIDQ5381999

Shengchun Wang, Jingui Huang

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

satisfiability problemexact algorithmNP-complete problemalgorithm complexityregular separability

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 difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: 一类可分离SAT问题的O(1.890 n )精确算法