The hardness of approximate optima in lattices, codes, and systems of linear equations
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 724-733
- https://doi.org/10.1109/sfcs.1993.366815
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- NP-complete problems have a version that's hard to approximatePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust trainability of single neuronsPublished by Association for Computing Machinery (ACM) ,1992
- Two-prover one-round proof systemsPublished by Association for Computing Machinery (ACM) ,1992
- Self-testing/correcting with applications to numerical problemsPublished by Association for Computing Machinery (ACM) ,1990
- Designing programs that check their workPublished by Association for Computing Machinery (ACM) ,1989
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988
- Minkowski's Convex Body Theorem and Integer ProgrammingMathematics of Operations Research, 1987
- An application of simultaneous approximation in combinatorial optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- The densest hemisphere problemTheoretical Computer Science, 1978