Lower bounds for algebraic decision trees
References (17)
A nonlinear lower bound on linear search tree programs for solving knapsack problems
J. Comput. System Sci.
(1976)- et al.
A lower bound of on linear search programs for the knapsack problem
J. Comput. System Sci.
(1978) Proving the simultaneous positivity of linear forms
J. Comput. System Sci.
(1972)Real algebraic geometry (The 16th Hilbert problem)
Some Recollections from 30 Years Ago
- et al.
On the complexity of varying sets of primitives
J. Comput. System Sci.
(1980) - et al.
Foundations of Algebraic Topology
(1952)
There are more references available in the full text version of this article.
Cited by (95)
Rough analysis of computation trees
2022, Discrete Applied MathematicsCitation Excerpt :Linear decision trees and algebraic decision and computation trees were studied most intensively. Lower bounds on the complexity were obtained in [2,4,5] for linear decision trees, in [19–21] for algebraic decision trees, in [1,6] for algebraic computation trees, and in [7] for Pfaffian computation trees. Upper bounds on the complexity were obtained in [3,8,10] for linear decision trees and in [17] for quasilinear decision trees that includes linear decision trees and some kinds of algebraic decision trees.
Local polyhedra and geometric graphs
2005, Computational Geometry: Theory and ApplicationsOn the decisional complexity of problems over the reals
2001, Information and ComputationSome Speed-Ups and Speed Limits for Real Algebraic Geometry
2000, Journal of ComplexityTopological lower bounds on algebraic random access machines
2002, SIAM Journal on Computing
- ∗
The research of this author was supported in part by Office of Naval Research Contract N00014-76-C-0475 (NR-042-267).
- †
The research of this author was supported in part by National Science Foundation Grant MCS-77-05313-A01.
Copyright © 1982 Published by Elsevier Inc.