Journal: Electronic Colloquium on Computational Complexity (ECCC)

Volume 10, Issue 020

0 -- 0Elad Hazan, Shmuel Safra, Oded Schwartz. On the Hardness of Approximating k-Dimensional Matching