From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP

DOI10.1007/978-3-319-93031-2_14MaRDI QIDQ1626727zbMATH OpenOpenAlexFDO

Authors Guillaume Escamocher, Mohamed Siala, Barry O'Sullivan

Publication date 21 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-93031-2_14

Mathematics Subject Classification ID

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

Recommendations

• SOFSEM 2004: Theory and Practice of Computer Science
• Backdoors into heterogeneous classes of SAT and CSP
• Backdoor sets for CSP
• Principles and Practice of Constraint Programming – CP 2003
• Backdoor sets for DLL subsolvers

Cited in

(2)

• SOFSEM 2004: Theory and Practice of Computer Science
• Backdoors into heterogeneous classes of SAT and CSP

This page was built for publication: From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP

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