Sökning: "Nadia Creignou"
Hittade 1 avhandling innehållade orden Nadia Creignou.
1. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
Sammanfattning : 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 algebra. LÄS MER
Resultatsidor:
1