Sciweavers

Share
COCO   2011 Annual IEEE Conference on Computational Complexity
Wall of Fame | Most Viewed COCO-2011 Paper
COCO
2011
Springer
261views Algorithms» more  COCO 2011»
7 years 3 months ago
Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic Groups
—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...
Ryan O'Donnell, Yi Wu, Yuan Zhou
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.
IdReadViewsTitleStatus
1Download preprint from source261
2Download preprint from source221
3Download preprint from source217
4Download preprint from source216
5Download preprint from source209
books