Sökning: "Numerical Analysis and Computer Science NADA Faculty of Science Stockholm University"
Hittade 1 avhandling innehållade orden Numerical Analysis and Computer Science NADA Faculty of Science Stockholm University.
1. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
Sammanfattning : Problem solving is an integral aspect of modern society and includes such tasks as picking the fastest route to work, optimizing a production line, scheduling computer tasks, placing new bus stops, or picking a meal from available ingredients.We study the hardness of solving Constraint Satisfaction Problems (CSPs). LÄS MER
Resultatsidor:
1