An algorithm for exact satisfiability analysed with the number of clauses as parameter

DOI10.1016/j.ipl.2005.08.011zbMath1185.68647OpenAlexW2030227772MaRDI QIDQ1045885

Bolette Ammitzbøll Madsen

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.011

zbMATH Keywords

analysis of algorithmsexact satisfiability

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Partition into triangles on bounded degree graphs ⋮ Exact algorithms for exact satisfiability and number of perfect matchings ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls

Cites Work

• Unnamed Item
• Enumerating maximal independent sets with applications to graph colouring.
• Exact satisfiability, a natural extension of set partition, and its average case behavior
• New worst-case upper bounds for SAT
• New algorithms for exact satisfiability
• STACS 2004
• The complexity of satisfiability problems
• SOFSEM 2005: Theory and Practice of Computer Science
• Theory and Applications of Satisfiability Testing

This page was built for publication: An algorithm for exact satisfiability analysed with the number of clauses as parameter