Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR11-112 | 10th August 2011 15:09

The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover

TR11-112
Authors: Dana Moshkovitz
Publication: 10th August 2011 16:04