An improved exact algorithm for the exact satisfiability problem

DOI10.1007/978-3-030-64843-5_21MaRDI QIDQ2692222zbMATH OpenOpenAlexFDO

Authors Gordon Hoi

Publication date 21 March 2023

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

zbMATH Keywords

measure and conquerexponential time algorithmsXSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited in

(6)

• An improved exact algorithm for the domatic number problem
• scientific article; zbMATH DE number 5575002 (Why is no real title available?)
• Algorithms for four variants of the exact satisfiability problem
• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
• Improved algorithms for the general exact satisfiability problem
• An improved algorithm for the evaluation of fixpoint expressions

This page was built for publication: An improved exact algorithm for the exact satisfiability problem

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