On the public citation graph
The Distribution of Condition Numbers of Rational Data of Bounded Bit Length
0 signed · 47 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.1006/jcom.1993.1002openalex-snapshot
Complexity of Bezout′s Theorem
inferredcites →https://doi.org/10.1006/jcom.2000.0572openalex-snapshot
Kronecker's and Newton's Approaches to Solving: A First Comparison
inferredcites →https://doi.org/10.1007/978-1-4612-2752-6_19openalex-snapshot
Complexity of Bezout’s Theorem II Volumes and Probabilities
inferredcites →https://doi.org/10.1007/978-1-4757-1810-2openalex-snapshot
Fundamentals of Diophantine Geometry
inferredcites →https://doi.org/10.1007/bf01475864openalex-snapshot
�ber die Gleichverteilung von Zahlen mod. Eins
inferredcites →https://doi.org/10.1007/bf02288367openalex-snapshot
The Approximation of One Matrix by Another of Lower Rank
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1016/0304-3975(94)90122-8openalex-snapshot
Complexity of Bezout's theorem V: polynomial time
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(86)90020-8openalex-snapshot
On the existence of generally convergent algorithms
inferredcites →https://doi.org/10.1016/s0022-4049(98)00148-0openalex-snapshot
On the intrinsic complexity of the arithmetic Nullstellensatz
inferredcites →https://doi.org/10.1017/cbo9780511662003.008openalex-snapshot
Heights of points on subvarieties of G
inferredcites →https://doi.org/10.1090/chel/358openalex-snapshot
Algebraic Numbers and Algebraic Functions
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/s0002-9939-1989-0961415-1openalex-snapshot
On the Number of Good Rational Approximations to Algebraic Numbers
inferredcites →https://doi.org/10.1090/s0002-9939-96-03519-8openalex-snapshot
Heights of algebraic points lying on curves or hypersurfaces
inferredcites →https://doi.org/10.1090/s0025-5718-1992-1106966-2openalex-snapshot
On the Distribution of a Scaled Condition Number
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-15349-2openalex-snapshot
Some extremal functions in Fourier analysis
inferredcites →https://doi.org/10.1090/s0273-0979-1985-15391-1openalex-snapshot
On the efficiency of algorithms of analysis
inferredcites →https://doi.org/10.1093/qjmam/1.1.287openalex-snapshot
ROUNDING-OFF ERRORS IN MATRIX PROCESSES
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.580-topenalex-snapshot
On a Principle of Lipschitz
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/0609045openalex-snapshot
Eigenvalues and Condition Numbers of Random Matrices
inferredcites →https://doi.org/10.1137/0733008openalex-snapshot
Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
inferredcites →https://doi.org/10.1215/s0012-7094-01-10934-4openalex-snapshot
Sharp estimates for the arithmetic Nullstellensatz
inferredcites →https://doi.org/10.24033/asens.1486openalex-snapshot
Computational complexity. On the geometry of polynomials and a theory of cost. I
inferredcites →https://doi.org/10.5860/choice.35-6275copenalex-snapshot
Complexity and real computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11549345_9openalex-snapshot
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions
inferred← citeshttps://doi.org/10.1007/s00200-016-0284-9openalex-snapshot
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
inferred← citeshttps://doi.org/10.1007/s10208-002-0065-7openalex-snapshot
The Hardness of Polynomial Equation Solving
inferred← citeshttps://doi.org/10.1007/s10208-005-0176-2openalex-snapshot
Estimates on the Distribution of the Condition Number of Singular Matrices
inferred← citeshttps://doi.org/10.1007/s10208-005-0211-0openalex-snapshot
On Smale's 17th Problem: A Probabilistic Positive Solution
inferred← citeshttps://doi.org/10.1007/s10208-013-9143-2openalex-snapshot
Robust Certified Numerical Homotopy Tracking
inferred← citeshttps://doi.org/10.1007/s10208-022-09551-1openalex-snapshot
The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite
inferred← citeshttps://doi.org/10.1016/j.crma.2005.05.012openalex-snapshot
Upper bounds on the distribution of the condition number of singular matrices
inferred← citeshttps://doi.org/10.1016/j.exmath.2007.07.001openalex-snapshot
A concise proof of the Kronecker polynomial system solver from scratch
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.05.006openalex-snapshot
Numerical stability of surface implicitization
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.05.005openalex-snapshot
On the probability distribution of singular varieties of given corank
inferred← citeshttps://doi.org/10.1016/s0885-064x(02)00028-6openalex-snapshot
Systems of rational polynomial equations have polynomial size approximate zeros on the average
inferred← citeshttps://doi.org/10.1016/s0885-064x(03)00010-4openalex-snapshot
Some remarks on the condition number of a real random square matrix
inferred← citeshttps://doi.org/10.1145/3476446.3535475openalex-snapshot
Beyond Worst-Case Analysis for Root Isolation Algorithms
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.