Lower bounds for algebraic computation trees

ABSTRACT

A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision trees. Using this method we are able to generalize, and present in a uniform and easy way, almost all the known nonlinear lower bounds for algebraic computations. Applying the method to decision trees we extend all the apparently known lower bounds for linear decision trees to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20]. We also show how this new method can be used to establish lower bounds on the complexity of constructions with ruler and compass in plane Euclidean geometry.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W. Baur and V. Strassen, The complexity of partial derivatives. to appear (1982).
	2	A. Borodin and I. Munro, Computational complexity of algebraic and numeric problems. American Elsevier, 1975.
	3	D. Dobkin, A nonlinear lower bound on linear search tree programs for solving knapsack problems. JCSS 13, (1976) 69-73.
	4	D.P. Dobkin and R.J. Lipton, A lower bound of ½ n2 on linear search programs for the knapsack problem. JCSS 16, (1978) 413-417.
	5	D.P. Dobkin and R.J. Lipton, On the complexity of computations under varying sets of primitives. JCSS 18, (1979) 86-91.
	6	Michael L. Fredman , Bruce Weide, On the complexity of computing the measure of ∪[a_i,b_i], Communications of the ACM, v.21 n.7, p.540-544, July 1978 [doi>10.1145/359545.359553]
	7	D. Hilbert, Foundations of geometry, 1899. Edited and reprinted by Open Court, 1971.
	8	Jerzy W. Jaromczyk, Lower Bounds for Problems Defined by Polynomial Inequalities, Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory, p.165-172, August 24-28, 1981
	9	Jerzy W. Jaromczyk, An Extension of Rabin's Complete Proof Concept, Proceedings on Mathematical Foundations of Computer Science, p.321-326, August 31-September 04, 1981
	10	Lemoine, Géométrographie, 1907.
	11	J. Milnor, On the betti numbers of real algebraic varieties. Proc. AMS 15, (1964) 275-280.
	12	J. Milnor, Singular points of complex hypersurfces. Princeton Univ. Press, 1968.
	13	M.O. Rabin, Proving simultaneous positivity of linear forms. JCSS 6, (1972) 639-650.
	14	M.O. Rabin, unpublished lecture notes (1977).
	15	Edward M. Reingold, On the Optimality of Some Set Algorithms, Journal of the ACM (JACM), v.19 n.4, p.649-659, Oct. 1972 [doi>10.1145/321724.321730]
	16	A. Schmitt, On the computational power of the floor function. Info. Proc. Let. 14, (1982) 1-3.
	17	C.P. Schnorr, An extension of Strassen's degree bound. SIAM J. Comput. 10, (1981) 371-382.
	18	Michael Ian Shamos, Geometric complexity, Proceedings of seventh annual ACM symposium on Theory of computing, p.224-233, May 05-07, 1975, Albuquerque, New Mexico, United States [doi>10.1145/800116.803772]
	19	M.I. Shamos, Problems in computational geometry, 1975.
	20	J.M. Steele and A.C. Yao, Lower bounds for algebraic decision trees. J. Algorithms 3, (1982) 1-8.
	21	V. Strassen, Die Berechnungskomplexität von elementarsymetrischen funktionen und von interpolationskoeffizienten. Numer. Math. 20, (1973) 238-251.
	22	V. Strassen, The computational complexity of continued fractions, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.51-67, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806371]
	23	R. Thom, Sur l'homologie des variétés algébriques réelles. Differential and Combinatorial Topology, Ed. S.S. Cairns, Princeton Univ. Press, 1965.
	24	A.C. Yao, On the complexity of comparison problems using linear functions. Proc. 16th STOC, Berkeley 1975, 85-89.
	25	Andrew C Yao, A lower bound to finding convex hulls, Stanford University, Stanford, CA, 1979
	26	A.C. Yao and R.L. Rivest, On the polyhedral decision problem. SIAM J. Comput. 9, (1980) 343-347.