A new method for proving lower bounds in the model of algebraic decision trees
Part of the Lecture Notes in Computer Science book series (LNCS, volume 464)
Part III Communications
KeywordsLower Bound Convex Hull Computational Geometry Facial Lattice Relation Test
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [E]Edelsbrunner, H.: Algorithms in Computational Geometry, Springer 1987.Google Scholar
- [PS]Preparata, F. P. and M. I. Shamos: Computational Geometry — an Introduction, Springer 1985.Google Scholar
- [SY]Steele, J. M. and A. C. Yao: Lower bounds for algebraic decision trees, J. Algorithms 3 (1982), pp. 1–8.Google Scholar
- [U]Unger, K.: Obere und untere Schranken für Probleme der algorithmischen Geometrie in problemspezifischen Modellen (Ph.D. Thesis), Berlin 1990.Google Scholar
© Springer-Verlag Berlin Heidelberg 1990