1. M. Bellare and P. Rogaway. The complexity of approximating a nonlinear program. In P. M. Pardalos, editor, Complexity in Numerical Optimization. World Scientific, 1993.
2. J. Canny. Some algebraic and geometric computations in PSPACE. In Proc. loth ACM Symposium on the Theory of Computing, pages 460–467, 1988.
3. S. A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.
4. J. E. Dennis and R. E. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice—Hall, Englewood Cliffs, New Jersey, 1983.
5. U. Feige, S. Goldwasser, L. Lovâsz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 2–12,1991.