On the public citation graph

Estimates of real roots of a system of algebraic equations

https://doi.org/10.1007/bf01095637
0 signed · 15 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.1007/3-540-07805-3_10openalex-snapshot
IX. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper
inferredcites →https://doi.org/10.1007/bf01095638openalex-snapshot
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
inferredcites →https://doi.org/10.1016/0304-3975(81)90064-5openalex-snapshot
Resolution des systemes d'equations algebriques
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.200910004openalex-snapshot
Two conjectures on the arithmetic in ℝ and ℂ
inferred← citeshttps://doi.org/10.1007/978-3-319-66700-3_10openalex-snapshot
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
inferred← citeshttps://doi.org/10.1007/s00224-015-9662-0openalex-snapshot
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals
inferred← citeshttps://doi.org/10.1007/s00224-018-9887-9openalex-snapshot
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
inferred← citeshttps://doi.org/10.1007/s00454-023-00562-5openalex-snapshot
The Complexity of the Hausdorff Distance
inferred← citeshttps://doi.org/10.1016/j.aim.2020.107043openalex-snapshot
Path developments and tail asymptotics of signature for pure rough paths
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80088-0openalex-snapshot
The complexity of deciding consistency of systems of polynomials in exponent inequalities
inferred← citeshttps://doi.org/10.1112/jlms/jdm069openalex-snapshot
On the number of homotopy types of fibres of a definable map
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605517openalex-snapshot
On the number of homotopy types of fibres of a definable map
inferred← citeshttps://doi.org/10.48550/arxiv.math/0702558openalex-snapshot
Bounds of some real (complex) solution of a finite system of polynomial equations with rational coefficients
inferred← citeshttps://doi.org/10.5802/aif.1246openalex-snapshot
Smoothing of real algebraic hypersurfaces by rigid isotopies
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.