From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP
From MaRDI portal
Publication:1626727
DOI10.1007/978-3-319-93031-2_14MaRDI QIDQ1626727
Barry O'Sullivan, Guillaume Escamocher, Mohamed Siala
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_14
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)