The complexity of approximating a nonlinear program
- 1 July 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 69 (1-3) , 429-441
- https://doi.org/10.1007/bf01585569
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Interactive proofs and approximation: reductions from two provers in one roundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the success probability of the two provers in one-round proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved non-approximability resultsPublished by Association for Computing Machinery (ACM) ,1994
- Efficient probabilistically checkable proofs and applications to approximationsPublished by Association for Computing Machinery (ACM) ,1993
- Two-prover one-round proof systemsPublished by Association for Computing Machinery (ACM) ,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
- Some algebraic and geometric computations in PSPACEPublished by Association for Computing Machinery (ACM) ,1988
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988