Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Subject "Hardness of Approximation"
Now showing items 1-1 of 1
-
New Algorithmic and Hardness Results in Learning, Error Correcting Codes and Constraint Satisfaction Problems
Approximation algorithms are a natural way to deal with the intractability barrier that is inherent in many naturally arising computational problems. However, it is often the case that the task of solving the approximation ...