On the hardness of approximating label-cover
- 16 March 2004
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 89 (5), 247-254
- https://doi.org/10.1016/j.ipl.2003.11.007
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Parallel Repetition TheoremSIAM Journal on Computing, 1998
- Minimum propositional proof length is NP-hard to linearly approximatePublished by Springer Science and Business Media LLC ,1998
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974