The constraint satisfaction problem (CSP) is a widely studied problem with numerous applications in computer science. For infinitedomain CSPs, there are many results separating tractable and NP-hard cases while upper bounds on the time complexity of hard cases are virtually unexplored. Hence, we initiate a study of the worst-case time cmplexity of such CSPs.We analyse backtracking algorithms and show that they can be improved by exploiting sparsification. We present even faster algorithms based on enumerating finite structures. Last, we prove non-trivial lower bounds applicable to many interesting CSPs, under the assumption that the strong exponential-time hypothesis is true.
CITATION STYLE
Jonsson, P., & Lagerkvist, V. (2015). Upper and lower bounds on the time complexity of infinite-domain CSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9255, pp. 183–199). Springer Verlag. https://doi.org/10.1007/978-3-319-23219-5_14
Mendeley helps you to discover research relevant for your work.