On the public citation graph
Some Remarks on the Foundations of Numerical Analysis
0 signed · 82 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01400115openalex-snapshot
On condition numbers and the distance to the nearest ill-posed problem
inferredcites →https://doi.org/10.1007/bf01446807openalex-snapshot
Ueber die numerische Aufl�sung von Differentialgleichungen
inferredcites →https://doi.org/10.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1016/0377-0427(88)90402-5openalex-snapshot
Complexity theory of numerical linear algebra
inferredcites →https://doi.org/10.1016/0885-064x(87)90022-7openalex-snapshot
On the worst-case arithmetic complexity of approximating zeros of polynomials
inferredcites →https://doi.org/10.1016/0885-064x(87)90027-6openalex-snapshot
The geometry of III-conditioning
inferredcites →https://doi.org/10.1016/0885-064x(89)90029-0openalex-snapshot
Topological complexity of a root finding algorithm
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/0885-064x(91)90002-fopenalex-snapshot
Condition numbers of random matrices
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.1090/s0273-0979-1981-14858-8openalex-snapshot
The fundamental theorem of algebra and complexity theory
inferredcites →https://doi.org/10.1090/s0273-0979-1985-15391-1openalex-snapshot
On the efficiency of algorithms of analysis
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.1137/0215011openalex-snapshot
Computational Complexity : On the Geometry of Polynomials and a Theory of Cost: II
inferredcites →https://doi.org/10.1137/0215026openalex-snapshot
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
inferredcites →https://doi.org/10.1137/0609045openalex-snapshot
Eigenvalues and Condition Numbers of Random Matrices
inferredcites →https://doi.org/10.1137/1.9781611975208openalex-snapshot
Elementary Numerical Analysis
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/moor.12.1.121openalex-snapshot
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/1971361openalex-snapshot
Bounds for the Degrees in the Nullstellensatz
inferredcites →https://doi.org/10.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes
inferredcites →https://doi.org/10.24033/asens.1486openalex-snapshot
Computational complexity. On the geometry of polynomials and a theory of cost. I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470018860.s00010openalex-snapshot
Real‐Valued Computation and Complexity
inferred← citeshttps://doi.org/10.1006/jcom.1997.0446openalex-snapshot
Real Data—Integer Solution Problems within the Blum–Shub–Smale Computational Model
inferred← citeshttps://doi.org/10.1006/jcom.1997.0465openalex-snapshot
A Refined Model of Computation for Continuous Problems
inferred← citeshttps://doi.org/10.1006/jcom.2001.0581openalex-snapshot
A Theory of Complexity for Continuous Time Systems
inferred← citeshttps://doi.org/10.1006/jcom.2001.0607openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1006/jcss.1997.1478openalex-snapshot
A Weak Version of the Blum, Shub, and Smale Model
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_22openalex-snapshot
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_5openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_59openalex-snapshot
Recursiveness over the complex numbers is time-bounded
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_20openalex-snapshot
Convergence of Finite-Element Solutions for Nonlinear PDEs
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_28openalex-snapshot
On the Work of Steve Smale on the Theory of Computation
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_30openalex-snapshot
Steve Smale and the Geometry of Ill-Conditioning
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_42openalex-snapshot
Error Estimates of Ritz—Gelerkin Methods for Indefinite Elliptic Equations
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_5openalex-snapshot
Professional Biography, Bibliography, and Graduate Students
inferred← citeshttps://doi.org/10.1007/978-3-030-21920-8_30openalex-snapshot
A Neglected Theorem - Numerical Analysis via Variable Interval Computing
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_35openalex-snapshot
Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods
inferred← citeshttps://doi.org/10.1007/978-981-13-2285-3_12openalex-snapshot
A Multiple String and Pattern Matching Algorithm Using Context-Free Grammar
inferred← citeshttps://doi.org/10.1007/bf01582132openalex-snapshot
On the complexity of linear programming under finite precision arithmetic
inferred← citeshttps://doi.org/10.1007/bf01585941openalex-snapshot
Linear programming, complexity theory and elementary functional analysis
inferred← citeshttps://doi.org/10.1007/bf01590957openalex-snapshot
On the complexity of solving feasible systems of linear inequalities specified with approximate data
inferred← citeshttps://doi.org/10.1007/bf03025291openalex-snapshot
Mathematical problems for the next century
inferred← citeshttps://doi.org/10.1007/s101070050088openalex-snapshot
Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system
inferred← citeshttps://doi.org/10.1007/s11229-020-02654-8openalex-snapshot
Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
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/0893-6080(93)90017-qopenalex-snapshot
Pulse propagation networks: A neural network model that uses temporal coding by action potentials
inferred← citeshttps://doi.org/10.1016/0893-6080(94)90106-6openalex-snapshot
Response to letter by E. V. Krishnamurthy
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.12.001openalex-snapshot
Computable scalar fields: A basis for PDE software
inferred← citeshttps://doi.org/10.1016/s0885-064x(02)00017-1openalex-snapshot
Algorithmic analysis of irrational rotations in a single neuron model
inferred← citeshttps://doi.org/10.1016/s0893-9659(01)00116-1openalex-snapshot
An alternative to Ben-Or's lower bound for the knapsack problem complexity
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11001-5openalex-snapshot
On the Foundations of Computational Mathematics
inferred← citeshttps://doi.org/10.1017/fms.2015.2openalex-snapshot
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
inferred← citeshttps://doi.org/10.1017/s0962492900002774openalex-snapshot
Complexity theory and numerical analysis
inferred← citeshttps://doi.org/10.1090/conm/604/12067openalex-snapshot
Topics in real and complex number complexity theory
inferred← citeshttps://doi.org/10.1090/conm/604/12069openalex-snapshot
The complexity and geometry of numerically solving polynomial systems.
inferred← citeshttps://doi.org/10.1093/bjps/54.2.181openalex-snapshot
Hypercomputation and the Physical Church‐Turing Thesis
inferred← citeshttps://doi.org/10.1093/philmat/nkad011openalex-snapshot
On Algorithms, Effective Procedures, and Their Definitions
inferred← citeshttps://doi.org/10.1103/physrevlett.83.1463openalex-snapshot
Computational Complexity for Continuous Time Dynamics
inferred← citeshttps://doi.org/10.1109/cnna.2002.1035067openalex-snapshot
Computational and computer complexity of analogic cellular wave computers
inferred← citeshttps://doi.org/10.1109/ijcnn.1998.686020openalex-snapshot
Non-suspiciousness: a generalisation of convexity in the frame of foundations of numerical analysis and learning
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366838openalex-snapshot
A weak version of the Blum, Shub and Smale model
inferred← citeshttps://doi.org/10.1137/040609264openalex-snapshot
Incorporating Condition Measures in the Context of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/s105262349223352xopenalex-snapshot
Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
inferred← citeshttps://doi.org/10.1137/s1052623494268467openalex-snapshot
On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
inferred← citeshttps://doi.org/10.1142/s0218126603000921openalex-snapshot
THE CNN UNIVERSAL MACHINE: 10 YEARS LATER
inferred← citeshttps://doi.org/10.1145/2213556.2213579openalex-snapshot
Approximate computation and implicit regularization for very large-scale data analysis
inferred← citeshttps://doi.org/10.1145/345542.345557openalex-snapshot
Solving polynomial systems (invited talk abstract)
inferred← citeshttps://doi.org/10.1155/2000/482042openalex-snapshot
Case Study on Algebraic Software Methodologies for Scientific Computing
inferred← citeshttps://doi.org/10.1287/moor.22.4.769openalex-snapshot
On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
inferred← citeshttps://doi.org/10.1515/9783110889178.29openalex-snapshot
Three lectures on real computation
inferred← citeshttps://doi.org/10.36045/bbms/1105730626openalex-snapshot
A survey on real structural complexity theory
inferred← citeshttps://doi.org/10.48550/arxiv.math/0305004openalex-snapshot
The complexity of accurate floating point computation
inferred← citeshttps://doi.org/10.61426/sjbcm.v8i1.1937openalex-snapshot
LEADER EMOTIONAL INTELLIGENCE AND WORKPLACE HARMONY OF PLASTIC MANUFACTURING COMPANIES IN RIVERS STATE, NIGERIA
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.