The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The complexity of partial derivatives
Open accessAbstract
Abstract Let L denote the nonscalar complexity in k ( x 1 ,…, x n ). We prove L(ƒ,∂ƒ/∂x 1 ,…,∂ƒ/∂x n )⩽3L(ƒ) . Using this we determine the complexity of single power sums, single elementary symmetric functions, the resultant and the discriminant as root functions, up to order of magnitude. Also we linearly reduce matrix inversion to computing the determinant.
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
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Self-citationTHE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 396
The Art of Computer Programming. Vol. II: Seminumerical Algorithms
W., J. W., & Knuth, D. E. (1970) · Mathematics of Computation · doi:10.2307/2004500 · Cited by 291
Die Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
Strassen, V. (1973) · Numerische Mathematik · doi:10.1007/bf01436566 · Cited by 150
Self-citationStrassen, V. (1972) · Acta Informatica · doi:10.1007/bf00289512 · Cited by 51
Self-citationAn Extension of Strassen’s Degree Bound
Schnorr, C. P. (1981) · SIAM Journal on Computing · doi:10.1137/0210026 · Cited by 11
Cited by
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Lower bounds for algebraic computation trees
Ben-Or, M. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808735 · Cited by 521
Geometrically Constrained Trajectory Optimization for Multicopters
Wang, Z., Zhou, X., Xu, C., & Gao, F. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3160022 · Cited by 434
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Differentiable Programming Tensor Networks
Liao, H.-J., Liu, J.-G., Wang, L., & Xiang, T. (2019) · Physical Review X · doi:10.1103/physrevx.9.031041 · Cited by 251
Metadata
- Authors
- Baur, W., & Strassen, V.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1983-02
- Volume
- 22
- Issue
- 3
- Pages
- 317-330
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W1973342538
- Cited by
- 468
- References
- 6
- FWCI
- 10.65
- Type
- journal article
- Language
- en
- Open access
- bronze
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: The complexity of partial derivatives. https://app.cochat.ai/papers/10.1016/0304-3975(83)90110-x
- The paper
- Baur, W., & Strassen, V. (1983). The complexity of partial derivatives. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(83)90110-x
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.