Sökning: "Miki Hermann"
Hittade 1 avhandling innehållade orden Miki Hermann.
1. Exploiting Structure in CSP-related Problems
Sammanfattning : 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. LÄS MER
Resultatsidor:
1