The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Lower bounds for algebraic computation trees
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the Betti numbers of real varieties
Milnor, J. (1964) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1964-0161339-9 · Cited by 500
The complexity of partial derivatives
Baur, W., & Strassen, V. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90110-x · Cited by 468
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 396
A Lower Bound to Finding Convex Hulls
Yao, A. C.-C. (1981) · Journal of the ACM · doi:10.1145/322276.322289 · Cited by 157
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
Strassen, V. (1973) · Numerische Mathematik · doi:10.1007/bf01436566 · Cited by 150
The Computational Complexity of Continued Fractions
Strassen, V. (1983) · SIAM Journal on Computing · doi:10.1137/0212001 · Cited by 94
The computational complexity of continued fractions
Strassen, V. (1981) · ACM Symposium on Symbolic and Algebraic Computation (SYMSAC) · doi:10.1145/800206.806371 · Cited by 17
An Extension of Strassen’s Degree Bound
Schnorr, C. P. (1981) · SIAM Journal on Computing · doi:10.1137/0210026 · Cited by 11
Cited by
Computational Geometry—A Survey
Lee, & Preparata (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676388 · Cited by 283
Fast approximate computations with Cauchy matrices and polynomials
Pan, V. (2017) · Mathematics of Computation · doi:10.1090/mcom/3204 · Cited by 21
“ution of Problems 2 and 3, respectively, and equation (3.7) of the present subsection extends this bound to Problem 4. For mnthe bound is within a factor of log(n)log(log(n)) from the optimum [S73], [B-O83], [BM75]. The cited algorithms supporting this bound require extended precision of computing and fail already for…”
BackgroundInfluential
Metadata
- Authors
- Ben-Or, M.
- Venue
- Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
- Publisher
- ACM Press
- Published
- 1983
- Pages
- 80-86
- OpenAlex
- W2059985428
- Cited by
- 521
- References
- 8
- FWCI
- 9.02
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lower bounds for algebraic computation trees. https://app.cochat.ai/papers/10.1145/800061.808735
- The paper
- Ben-Or, M. (1983). Lower bounds for algebraic computation trees. Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83. https://doi.org/10.1145/800061.808735
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.