Search for dissertations about: "Hannes Uppman"
Found 1 swedish dissertation containing the words Hannes Uppman.
-
1. On Some Combinatorial Optimization Problems : Algorithms and Complexity
Abstract : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). READ MORE
Result pages:
1