Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
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 whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal alge...
| Main Author: | |
|---|---|
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Linköpings universitet, Programvara och system
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-122827 http://nbn-resolving.de/urn:isbn:978-91-7685-856-1 (print) |