Guillaume Escamocher, Mohamed Siala 0002, Barry O'Sullivan. From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP. In Willem Jan van Hoeve, editor, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings. Volume 10848 of Lecture Notes in Computer Science, pages 198-214, Springer, 2018. [doi]
@inproceedings{Escamocher0O18,
title = {From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP},
author = {Guillaume Escamocher and Mohamed Siala 0002 and Barry O'Sullivan},
year = {2018},
doi = {10.1007/978-3-319-93031-2_14},
url = {https://doi.org/10.1007/978-3-319-93031-2_14},
researchr = {https://researchr.org/publication/Escamocher0O18},
cites = {0},
citedby = {0},
pages = {198-214},
booktitle = {Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings},
editor = {Willem Jan van Hoeve},
volume = {10848},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-93031-2},
}