On the public citation graph
A Weak Version of the Blum, Shub, and Smale Model
0 signed · 56 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09510-1_42openalex-snapshot
On the power of random access machines
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1openalex-snapshot
Effective Methods in Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_5openalex-snapshot
On algorithms for real algebraic plane curves
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_12openalex-snapshot
Computing in Algebraic Extensions
inferredcites →https://doi.org/10.1016/0304-3975(94)00069-7openalex-snapshot
Separation of complexity classes in Koiran's weak model
inferredcites →https://doi.org/10.1016/0304-3975(94)90178-3openalex-snapshot
Analog computation via neural networks
inferredcites →https://doi.org/10.1016/0378-4754(87)90121-2openalex-snapshot
Theory of linear and integer programming
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.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1016/s0747-7171(88)80008-7openalex-snapshot
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties
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.1109/sfcs.1993.366838openalex-snapshot
A weak version of the Blum, Shub and Smale model
inferredcites →https://doi.org/10.1137/0404038openalex-snapshot
On the Power of Threshold Circuits with Small Weights
inferredcites →https://doi.org/10.1137/1032043openalex-snapshot
Some Remarks on the Foundations of Numerical Analysis
inferredcites →https://doi.org/10.1137/s0097539793256041openalex-snapshot
Bounds for the Computational Power and Learning Complexity of Analog Neural Nets
inferredcites →https://doi.org/10.1145/1089310.1089312openalex-snapshot
Computer algebra symbolic and algebraic computation
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcom.2000.0568openalex-snapshot
On a Transfer Theorem for the P≠NP Conjecture
inferred← citeshttps://doi.org/10.1007/11780342_25openalex-snapshot
A Measure of Space for Computing over the Reals
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_2openalex-snapshot
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_25openalex-snapshot
There Are No Sparse NPw-Hard Sets
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_3openalex-snapshot
Circuits versus Trees in Algebraic Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_41openalex-snapshot
On Measures of Space over Real and Complex Numbers
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_20openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_22openalex-snapshot
Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_24openalex-snapshot
On Weak-Space Complexity over Complex Numbers
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/s10208-005-0146-xopenalex-snapshot
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
inferred← citeshttps://doi.org/10.1007/s10208-007-9006-9openalex-snapshot
Exotic Quantifiers, Complexity Classes, and Complete Problems
inferred← citeshttps://doi.org/10.1016/0304-3975(93)00063-bopenalex-snapshot
Computing over the reals with addition and order
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90122-8openalex-snapshot
Complexity of Bezout's theorem V: polynomial time
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.011openalex-snapshot
On sparseness, reducibilities, and complexity
inferred← citeshttps://doi.org/10.1016/j.jco.2005.11.001openalex-snapshot
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00197-1openalex-snapshot
Transfer theorems via sign conditions
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00060-8openalex-snapshot
Saturation and stability in the theory of computation over the reals
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00007-4openalex-snapshot
On weak and weighted computations over the real closure of Q
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00028-5openalex-snapshot
Dynamical recognizers: real-time language recognition by analog computers
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80537-1openalex-snapshot
On sparseness and Turing reducibility over the reals
inferred← citeshttps://doi.org/10.1017/fms.2025.10116openalex-snapshot
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
inferred← citeshttps://doi.org/10.1137/s0097539700379346openalex-snapshot
There are No Sparse NP w -Hard Sets
inferred← citeshttps://doi.org/10.1137/s0097539702415950openalex-snapshot
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
inferred← citeshttps://doi.org/10.1137/s0097539794270340openalex-snapshot
On the Power of Real Turing Machines over Binary Inputs
inferred← citeshttps://doi.org/10.1145/1007352.1007425openalex-snapshot
Counting complexity classes for numeric computations II
inferred← citeshttps://doi.org/10.1145/276698.276864openalex-snapshot
Are lower bounds easier over the reals?
inferred← citeshttps://doi.org/10.1145/3717823.3718269openalex-snapshot
Vanishing of Schubert Coefficients
inferred← citeshttps://doi.org/10.1162/089976699300016638openalex-snapshot
Discontinuities in Recurrent Neural Networks
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.249openalex-snapshot
Combinatorial Expressions and Lower Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0312007openalex-snapshot
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
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.