1. C. Bajaj, “Geometric optimization and computational geometry,” Ph.D. Thesis, Computer Science Technical Report TR84-629, Cornell University (Ithaca, NY, 1984).
2. M. Ben-Or, D. Kozen and J. Rief, “The complexity of elementary algebra and geometry,”Journal of Computer and System Sciences 32 (1986) 251–264.
3. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, “Time bounds for selection,”Journal of Computer and System Sciences 7 (1972) 448–461.
4. G.E. Collins, “Quantifier elimination for real closed fields by cylindric algebraic decomposition,”Proceedings 2nd GI Conference on Automata Theory and Formal Languages, Lecture Notes in Computer Science, Vol. 35 (Springer-Verlag, Berlin, 1975) pp. 134–183.
5. M.R. Garey, R.L. Graham and D.S. Johnson, “Some NP-complete geometric problems,”Proceedings 8th Annual ACM Symposium on the Theory of Computing (1976) 10–22.