{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article10035","name":"Time Complexity of Constraint Satisfaction via Universal Algebra","abstract":"The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c^n) time for arbitrary c > 1, where n denotes the number of variables. Problems like k-SAT can be viewed as special cases of the constraint satisfaction problem (CSP), which is the problem of determining whether a set of constraints is satisfiable. In this paper we study the worst-case time complexity of NP-complete CSPs. Our main interest is in the CSP problem parameterized by a constraint language Gamma (CSP(Gamma)), and how the choice of Gamma affects the time complexity. It is believed that CSP(Gamma) is either tractable or NP-complete, and the algebraic CSP dichotomy conjecture gives a sharp delineation of these two classes based on algebraic properties of constraint languages. Under this conjecture and the ETH, we first rule out the existence of subexponential algorithms for finite domain NP-complete CSP(Gamma) problems. This result also extends to certain infinite-domain CSPs and structurally restricted CSP(Gamma) problems. We then begin a study of the complexity of NP-complete CSPs where one is allowed to arbitrarily restrict the values of individual variables, which is a very well-studied subclass of CSPs. For such CSPs with finite domain D, we identify a relation SD such that (1) CSP({SD}) is NP-complete and (2) if CSP(Gamma) over D is NP-complete and solvable in O(c^n) time, then CSP({SD}) is solvable in O(c^n) time, too. Hence, the time complexity of CSP({SD}) is a lower bound for all CSPs of this particular kind. We also prove that the complexity of CSP({SD}) is decreasing when |D| increases, unless the ETH is false. This implies, for instance, that for every c>1 there exists a finite-domain Gamma such that CSP(Gamma) is NP complete and solvable in O(c^n) time.","keywords":["Clone Theory","Universal Algebra","Constraint Satisfaction Problems"],"author":[{"@type":"Person","name":"Jonsson, Peter","givenName":"Peter","familyName":"Jonsson"},{"@type":"Person","name":"Lagerkvist, Victor","givenName":"Victor","familyName":"Lagerkvist"},{"@type":"Person","name":"Roy, Biman","givenName":"Biman","familyName":"Roy"}],"position":17,"pageStart":"17:1","pageEnd":"17:15","dateCreated":"2017-12-01","datePublished":"2017-12-01","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Jonsson, Peter","givenName":"Peter","familyName":"Jonsson"},{"@type":"Person","name":"Lagerkvist, Victor","givenName":"Victor","familyName":"Lagerkvist"},{"@type":"Person","name":"Roy, Biman","givenName":"Biman","familyName":"Roy"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2017.17","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1703.03021","http:\/\/dx.doi.org\/10.1137\/S0097539700376676","http:\/\/dx.doi.org\/10.1613\/jair.4540","http:\/\/dx.doi.org\/10.1016\/j.tcs.2017.03.006","http:\/\/dx.doi.org\/10.1137\/120868177","http:\/\/dx.doi.org\/10.1145\/263867.263489","http:\/\/arxiv.org\/abs\/1706.05902","http:\/\/arxiv.org\/abs\/1701.02409","https:\/\/arxiv.org\/abs\/1704.01914"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume6286","volumeNumber":83,"name":"42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)","dateCreated":"2017-12-01","datePublished":"2017-12-01","editor":[{"@type":"Person","name":"Larsen, Kim G.","givenName":"Kim G.","familyName":"Larsen"},{"@type":"Person","name":"Bodlaender, Hans L.","givenName":"Hans L.","familyName":"Bodlaender"},{"@type":"Person","name":"Raskin, Jean-Francois","givenName":"Jean-Francois","familyName":"Raskin"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article10035","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6286"}}}