Strong Partial Clones and the Complexity of Constraint Satisfaction Problems: Limitations and Applications
V Lagerkvist - 2016 - diva-portal.org
In this thesis we study the worst-case time complexity of the constraint satisfaction problem
parameterized by a constraint language (CSP (S)), which is the problem of determining …
parameterized by a constraint language (CSP (S)), which is the problem of determining …
[PDF][PDF] Strong Partial Clones and the Complexity of Constraint Satisfaction Problems
V Lagerkvist - scholar.archive.org
In this thesis we study the worst-case time complexity of the constraint satisfaction problem
parameterized by a constraint language (CSP (S)), which is the problem of determining …
parameterized by a constraint language (CSP (S)), which is the problem of determining …