Abstract
In this paper we have shown some results for decision trees with tests from the essentially wider class of functions than the polynomials of bounded degree.
We introduced the notion of functions r-distant to Rd[x] and have shown how starting from decision trees we can derive lower bounds in the model of computation trees. This relation suggests an uniform approach to lower bound proving in decision and computational tree models.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ben-Or,M., Lower bounds for algebraic computation trees, Proc. of the 15-th STOC, Boston, 1983, 80–86.
Jaromczyk,J.W.,Lower bounds for polygon simplicity testing and other problems, Lecture Notes in Computer Science v.176, 1984
Jaromczyk,J.W., Computational complexity in the model of decision trees, Warsaw, April 1984 (in polish).
Milnor, J., On the Betti numbers of real algebraic varieties, Proc. AMS 15, 1964, 275–280.
Steele, J.M., Yao, A.C., Lower bounds for algebraic decision trees, J.Algorithms 3, 1982, 1–8.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaromczyk, J.W. (1985). Some results on decision trees with relations to computational trees. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive