On the public citation graph
Information-Based complexity: New questions for mathematicians
0 signed · 42 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-13866-8openalex-snapshot
How to Multiply Matrices Faster
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_2openalex-snapshot
Solving Linear Equations by Means of Scalar Products
inferredcites →https://doi.org/10.1007/bf01396051openalex-snapshot
Bisection is not optimal on the average
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0167-6377(82)90047-5openalex-snapshot
Complexity of linear programming
inferredcites →https://doi.org/10.1016/0378-4754(89)90072-4openalex-snapshot
Information-based complexity
inferredcites →https://doi.org/10.1016/0885-064x(87)90003-3openalex-snapshot
On the optimality of Krylov information
inferredcites →https://doi.org/10.1016/0885-064x(88)90015-5openalex-snapshot
Approximation of smooth periodic functions in several variables
inferredcites →https://doi.org/10.1016/0885-064x(89)90009-5openalex-snapshot
A clock synchronization problem with random delays
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1070/rm1966v021n01abeh004147openalex-snapshot
METHODS OF COMPUTING VALUES OF POLYNOMIALS
inferredcites →https://doi.org/10.1090/s0273-0979-1987-15511-xopenalex-snapshot
Recent developments in information-based complexity
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.1126/science.243.4895.1142-aopenalex-snapshot
Information-Based Complexity
inferredcites →https://doi.org/10.1137/0721041openalex-snapshot
Complexity of Solving Linear Systems in Different Models of Computation
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/828.830openalex-snapshot
On the Optimal Solution of Large Linear Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1099-0526(200005/06)5:5<28::aid-cplx5>3.0.co;2-sopenalex-snapshot
Mathematical jujitsu: Some informal thoughts about G�del and physics
inferred← citeshttps://doi.org/10.1006/jcom.1997.0465openalex-snapshot
A Refined Model of Computation for Continuous Problems
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_52openalex-snapshot
Information-based complexity: Recent results and open problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_31openalex-snapshot
On Smale’s Work in the Theory of Computation: From Polynomial Zeros to Continuous Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-02199-2_3openalex-snapshot
What Makes a System Complex? - An Approach to Self Organization and Emergence
inferred← citeshttps://doi.org/10.1007/bf00052192openalex-snapshot
The average case complexity of the Fredholm equation of second kind with free term in H r (?)
inferred← citeshttps://doi.org/10.1007/bf02836122openalex-snapshot
Parallel information-based complexity of numerical integration on Sobolev class Wsq(Ω)
inferred← citeshttps://doi.org/10.1007/bf02836882openalex-snapshot
The average case complexity of the shift—Invariant problem
inferred← citeshttps://doi.org/10.1016/0167-739x(94)00068-popenalex-snapshot
Probabilistic parallel programming based on multiset transformation
inferred← citeshttps://doi.org/10.1016/0885-064x(92)90001-ropenalex-snapshot
Average case complexity of linear multivariate problems I. Theory
inferred← citeshttps://doi.org/10.1016/s1574-0021(96)01016-7openalex-snapshot
Chapter 14 Numerical dynamic programming in economics
inferred← citeshttps://doi.org/10.1017/s0962492925100287openalex-snapshot
Approximation of functions: Optimal sampling and complexity
inferred← citeshttps://doi.org/10.1080/00207169608804545openalex-snapshot
Parallel information-based complexity of numerical integration on holder classHs,αM(Ω)∗
inferred← citeshttps://doi.org/10.1080/00207169908804876openalex-snapshot
The worst case complexity of the fredholm equation with periodic free term and noisy information∗
inferred← citeshttps://doi.org/10.1080/01630569808816831openalex-snapshot
The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00240-9openalex-snapshot
Perspectives on information-based complexity
inferred← citeshttps://doi.org/10.1109/83.541423openalex-snapshot
Vector quantization with variable-precision classification
inferred← citeshttps://doi.org/10.1109/isic.2003.1254725openalex-snapshot
A coding and control mechanism of natural computation
inferred← citeshttps://doi.org/10.1109/phycmp.1992.615511openalex-snapshot
Complexity Of Neural Network Learning In The Real Number Model
inferred← citeshttps://doi.org/10.1109/tencon.1994.369141openalex-snapshot
Probabilistic concurrent programming using multiset transactions
inferred← citeshttps://doi.org/10.1142/s0129183198000170openalex-snapshot
Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation
inferred← citeshttps://doi.org/10.1214/ss/1177009938openalex-snapshot
Methods for Approximating Integrals in Statistics with Special Emphasis on Bayesian Integration Problems
inferred← citeshttps://doi.org/10.1515/9783110635461-005openalex-snapshot
5. Optimality criteria for probabilistic numerical methods
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.