From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Guillaume Escamocher' in GoogleThis author has not been identified. Look up 'Mohamed Siala 0002' in GoogleThis author has not been identified. Look up 'Barry O'Sullivan' in Google

runs on WebDSL