Sökning: "Regular Constraint Satisfaction Problems"
Hittade 1 avhandling innehållade orden Regular Constraint Satisfaction Problems.
1. Hardness of Approximating Constraint Satisfaction Problems and Their Variants in Presence of Additional Structural Assumptions
Sammanfattning : This thesis studies how the approximability of some fundamental computational problems is affected by some additional requirements on the structure of the inputs. The problems studied in this thesis belong or are closely related to constraint satisfaction problems (CSPs), which are considered to be one of the most fundamental problems in theoretical computer science. LÄS MER
Resultatsidor:
1