This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Edelsbrunner, H.: Algorithms in Computational Geometry, Springer 1987.
Preparata, F. P. and M. I. Shamos: Computational Geometry — an Introduction, Springer 1985.
Steele, J. M. and A. C. Yao: Lower bounds for algebraic decision trees, J. Algorithms 3 (1982), pp. 1–8.
Unger, K.: Obere und untere Schranken für Probleme der algorithmischen Geometrie in problemspezifischen Modellen (Ph.D. Thesis), Berlin 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Unger, K. (1990). A new method for proving lower bounds in the model of algebraic decision trees. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_50
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive