A well-characterized approximation problem
- 31 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The hardness of approximation: gap locationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The complexity of approximating a nonlinear programMathematical Programming, 1995
- Efficient probabilistically checkable proofs and applications to approximationsPublished by Association for Computing Machinery (ACM) ,1993
- On the hardness of approximating minimization problemsPublished by Association for Computing Machinery (ACM) ,1993
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Probabilistic checking of proofs; a new characterization of NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Small-bias probability spaces: efficient constructions and applicationsPublished by Association for Computing Machinery (ACM) ,1990