A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Martin C. Cooper, Guillaume Escamocher, Stanislav Zivny. A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP. In Michela Milano, editor, Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings. Volume 7514 of Lecture Notes in Computer Science, pages 265-273, Springer, 2012. [doi]

This author has not been identified. Look up 'Martin C. Cooper' in GoogleThis author has not been identified. Look up 'Guillaume Escamocher' in GoogleThis author has not been identified. Look up 'Stanislav Zivny' in Google

runs on WebDSL