On the public citation graph

Two Cubic Equations over the Reals: Generic Solvability and ∃R-Completeness

0 signed · 13 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/978-1-4612-1700-8openalex-snapshot
Intersection Theory
inferredcites →https://doi.org/10.1007/978-1-4614-0110-0_24openalex-snapshot
Realizability of Graphs and Linkages
inferredcites →https://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferredcites →https://doi.org/10.1007/978-3-319-02297-0_11openalex-snapshot
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees
inferredcites →https://doi.org/10.1007/bf02573959openalex-snapshot
Feasibility testing for systems of real quadratic equations
inferredcites →https://doi.org/10.1007/s00037-005-0189-7openalex-snapshot
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
inferredcites →https://doi.org/10.1016/0885-064x(90)90004-wopenalex-snapshot
A note on a theorem of Blum, Shub, and Smale
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1017/cbo9781139856065openalex-snapshot
Modern Computer Algebra
inferredcites →https://doi.org/10.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1145/2512329openalex-snapshot
Most Tensor Problems Are NP-Hard
inferredcites →https://doi.org/10.4064/sm-7-1-36-44openalex-snapshot
Über homogene Polynome in ($L^{2}$)
inferredcites →https://doi.org/10.4153/cjm-1965-053-6openalex-snapshot
Maxima for Graphs and a New Proof of a Theorem of Turán
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.