论文信息 - Lower Bounds for Algebraic Decision Trees - 字舞流文

Lower Bounds for Algebraic Decision Trees

J. Michael Steele | Andrew Chi-Chih Yao | A. Yao | J. Steele

[1] F. Gilman,et al. A lower bound on , 1983 .

[2] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.

[3] Andrew Chi-Chih Yao,et al. On the Polyhedral Decision Problem , 1980, SIAM J. Comput..

[4] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[5] J. E. Wetzel. On the Division of the Plane by Lines , 1978 .

[6] DAVID DOBKIN,et al. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..

[7] David P. Dobkin. A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems , 1976, J. Comput. Syst. Sci..

[8] Andrew Chi-Chih Yao,et al. On the complexity of comparison problems using linear functions , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[9] Michael O. Rabin,et al. Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..

[10] Edward M. Reingold,et al. Computing the Maximum and the Median , 1971, SWAT.

[11] A. Seidenberg. Elements of the theory of algebraic curves , 1968 .

[12] J. Milnor. On the Betti numbers of real varieties , 1964 .

[13] N. Steenrod,et al. Foundations of Algebraic Topology , 1952 .

[14] J. Steiner. Einige Gesetze über die Theilung der Ebene und des Raumes. , 1826 .