Search for dissertations about: "Tommy Färnqvist"
Found 1 swedish dissertation containing the words Tommy Färnqvist.
-
1. Exploiting Structure in CSP-related Problems
Abstract : In this thesis we investigate the computational complexity and approximability of computational problems from the constraint satisfaction framework. An instance of a constraint satisfaction problem (CSP) has three components; a set V of variables, a set D of domain values, and a set of constraints C. READ MORE
Result pages:
1