Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs

Peter Jonsson, Victor Lagerkvist. Upper and Lower Bounds on the Time Complexity of Infinite-Domain CSPs. In Gilles Pesant, editor, Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Volume 9255 of Lecture Notes in Computer Science, pages 183-199, Springer, 2015. [doi]

Abstract

Abstract is missing.