Sökning: "Beräkningsteori"
Hittade 1 avhandling innehållade ordet Beräkningsteori.
1. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
Sammanfattning : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). LÄS MER
Resultatsidor:
1