On the public citation graph

Additive Complexity and Zeros of Real Polynomials

https://doi.org/10.1137/0214014
0 signed · 37 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0304-3975(83)90110-xopenalex-snapshot
The complexity of partial derivatives
inferredcites →https://doi.org/10.1137/0205013openalex-snapshot
On the Number of Additions to Compute Specific Polynomials

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11779360_12openalex-snapshot
Interpolation of Functions Related to the Integer Factoring Problem
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_26openalex-snapshot
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_39openalex-snapshot
Additive Complexity and Roots of Polynomials over Number Fields and $$ \mathfrak{p} $$ -adic Fields
inferred← citeshttps://doi.org/10.1007/3-540-51082-6_85openalex-snapshot
On the computational complexity of polynomials and bilinear mappings. A survey
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_184openalex-snapshot
On Voronoi diagrams in the L p -metric in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02574682openalex-snapshot
Constraints on the angular distribution of the zeros of a polynomial of low complexity
inferred← citeshttps://doi.org/10.1007/bf02716806openalex-snapshot
On voronoi diagrams in theL p-metric in ℝD
inferred← citeshttps://doi.org/10.1007/bf03025343openalex-snapshot
Multivariate descartes rule of signs and sturmfels’s challenge problem
inferred← citeshttps://doi.org/10.1007/s00037-003-0180-0openalex-snapshot
Straight-line programs and torsion points on elliptic curves
inferred← citeshttps://doi.org/10.1007/s00454-003-2834-8openalex-snapshot
Counting Real Connected Components of Trinomial Curve Intersections and m -nomial Hypersurfaces
inferred← citeshttps://doi.org/10.1007/s00454-014-9642-1openalex-snapshot
On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90080-7openalex-snapshot
Bezout theorem for nash functions
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90059-oopenalex-snapshot
Verification complexity of linear prime ideals
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00177-8openalex-snapshot
Computability of the additive complexity of algebraic circuits with root extracting
inferred← citeshttps://doi.org/10.1016/0885-064x(92)90022-4openalex-snapshot
Test complexity of generic polynomials
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.106279openalex-snapshot
Intersection multiplicity of a sparse curve and a low-degree curve
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80007-5openalex-snapshot
Some aspects of complexity in real algebraic geometry
inferred← citeshttps://doi.org/10.1080/00927878908823796openalex-snapshot
Complexité des fonctions de nash
inferred← citeshttps://doi.org/10.1090/conm/605/12111openalex-snapshot
Fewnomial systems with many roots, and an Adelic Tau Conjecture
inferred← citeshttps://doi.org/10.1137/s0097539793258313openalex-snapshot
Computing the Additive Complexity of Algebraic Circuits with Root Extracting
inferred← citeshttps://doi.org/10.1145/1005285.1005310openalex-snapshot
On reducing a system of equations to a single equation
inferred← citeshttps://doi.org/10.1145/1277548.1277557openalex-snapshot
The complexity of quantifier elimination and cylindrical algebraic decomposition
inferred← citeshttps://doi.org/10.1216/rmj-1984-14-4-851openalex-snapshot
Havansky Theorem and complexity theory
inferred← citeshttps://doi.org/10.1353/ajm.2004.0005openalex-snapshot
Arithmetic multivariate Descartes' rule
inferred← citeshttps://doi.org/10.17323/1609-4514-2007-7-3-453-460openalex-snapshot
Counterexamples to Quantifier Elimination for Fewnomial and Exponential Expressions
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a010openalex-snapshot
inferred← citeshttps://doi.org/10.4171/jems/122openalex-snapshot
Analytic continuation and fixed points of the Poincaré mapping for a polynomial Abel equation
inferred← citeshttps://doi.org/10.4171/jems/468openalex-snapshot
On homotopy types of limits of semi-algebraic sets and additive complexity of polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1307.8353openalex-snapshot
Some Quantitative Results in Real Algebraic Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2447openalex-snapshot
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem
inferred← citeshttps://doi.org/10.48550/arxiv.math/0110327openalex-snapshot
Arithmetic Multivariate Descartes' Rule
inferred← citeshttps://doi.org/10.48550/arxiv.math/0201154openalex-snapshot
Additive Complexity and the Roots of Polynomials Over Number Fields and p-adic Fields
inferred← citeshttps://doi.org/10.48550/arxiv.math/0304100openalex-snapshot
A Direct Ultrametric Approach to Additive Complexity and the Shub-Smale Tau Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603534openalex-snapshot
Analytic continuation and fixed points of the Poincare mapping for a polynomial Abel equation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.