1. Anderson, R.M.: “Almost” Implies “Near”. Transactions of the American Mathematical Society 296(1), 229–237 (1986)
2. Basu, S., Pollack, R., Roy, M.: Algorithms in Real Algebraic Geometry, 2nd edn. Springer (2008)
3. Basu, S., Pollack, R., Roy, M.: Algorithms in Real Algebraic Geometry, online edition (2011),
http://perso.univ-rennes1.fr/marie-francoise.roy/bpr-ed2-posted2.html
4. Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261–272 (2006)
5. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: Procedings of the 38th Annual ACM Symposium on the Theory of Computing (STOC 2006), pp. 71–78 (2006)