Restricted Constraint Satisfaction Problems and the Exponential-time Hypothesis

A constraint satisfaction problem (CSP) can be represented as two structures: the structure induced by the variables and the structure induced by the constraint language. Both these parameters are amenable to restrictions which affects the complexity of the resulting problems. In this thesis we shal...

Full description

Bibliographic Details
Main Author: Lagerkvist, Victor
Format: Others
Language:English
Published: Linköpings universitet, Institutionen för datavetenskap 2012
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-82343