A new method for proving lower bounds in the model of algebraic decision trees

  • Kristel Unger
Part III Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 464)


Lower 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.

Unable to display preview. Download preview PDF.


  1. [DL]
    Dobkin, D.P. and R. Lipton: On the complexity of computations under varying sets of primitives, J. Comp. Syst. Sci. 18(1979), pp. 86–91.CrossRefGoogle Scholar
  2. [E]
    Edelsbrunner, H.: Algorithms in Computational Geometry, Springer 1987.Google Scholar
  3. [PS]
    Preparata, F. P. and M. I. Shamos: Computational Geometry — an Introduction, Springer 1985.Google Scholar
  4. [SY]
    Steele, J. M. and A. C. Yao: Lower bounds for algebraic decision trees, J. Algorithms 3 (1982), pp. 1–8.Google Scholar
  5. [U]
    Unger, K.: Obere und untere Schranken für Probleme der algorithmischen Geometrie in problemspezifischen Modellen (Ph.D. Thesis), Berlin 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Kristel Unger
    • 1
  1. 1.Karl-Weierstraß-Institut für MathematikBerlinGDR

Personalised recommendations