COCO 2011 Annual IEEE Conference on Computational Complexity
 |  |
Wall of Fame | Most Viewed COCO-2011 Paper
COCO
2011
Springer
12 years 11 months ago
2011
Springer
—In 1997, H˚astad showed NP-hardness of (1 − , 1/q + δ)-approximating Max-3Lin(Zq); however it was not until 2007 that Guruswami and Raghavendra were able to show NP-hardness...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 261 | ||
| 2 | | 221 | ||
| 3 | | 217 | ||
| 4 | | 216 | ||
| 5 | | 209 |