On the public citation graph

Complexity of Bezout’s Theorem IV: Probability of Success; Extensions

0 signed · 163 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.1006/jcom.1993.1002openalex-snapshot
Complexity of Bezout′s Theorem
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-4612-4984-9_13openalex-snapshot
Newton’s Method Estimates from Data at One Point
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/bf01399601openalex-snapshot
Numerical stability for solving nonlinear equations
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/bf01402528openalex-snapshot
Note on matrices with a very ill-conditioned eigenproblem
inferredcites →https://doi.org/10.1007/bf02288367openalex-snapshot
The Approximation of One Matrix by Another of Lower Rank
inferredcites →https://doi.org/10.1007/bfb0092042openalex-snapshot
Invariant Manifolds
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/0885-064x(87)90022-7openalex-snapshot
On the worst-case arithmetic complexity of approximating zeros of polynomials
inferredcites →https://doi.org/10.1016/0898-1221(87)90186-6openalex-snapshot
Sequential and parallel complexity of approximate evaluation of polynomial zeros
inferredcites →https://doi.org/10.1016/s0022-0000(05)80061-3openalex-snapshot
Specified precision polynomial root isolation is in NC
inferredcites →https://doi.org/10.1017/s0962492900002336openalex-snapshot
Continuation and path following
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0929546-7openalex-snapshot
The Probability That a Numerical Analysis Problem is Difficult
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-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.1090/s0894-0347-1993-1175980-4openalex-snapshot
Complexity of Bézout’s theorem. I. Geometric aspects
inferredcites →https://doi.org/10.1090/s0894-0347-1994-1231689-0openalex-snapshot
How Many Eigenvalues of a Random Matrix are Real?
inferredcites →https://doi.org/10.1109/fscs.1990.89534openalex-snapshot
Specified precision polynomial root isolation is in NC
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.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.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
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.1006/jcom.1997.0432openalex-snapshot
Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case
inferred← citeshttps://doi.org/10.1006/jcom.1998.0486openalex-snapshot
Some Lower Bounds for the Complexity of Continuation Methods
inferred← citeshttps://doi.org/10.1006/jcom.1999.0529openalex-snapshot
Deformation Techniques for Efficient Polynomial Equation Solving
inferred← citeshttps://doi.org/10.1006/jcom.1999.0532openalex-snapshot
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration
inferred← citeshttps://doi.org/10.1006/jcom.2000.0572openalex-snapshot
Kronecker's and Newton's Approaches to Solving: A First Comparison
inferred← citeshttps://doi.org/10.1006/jcom.2001.0585openalex-snapshot
On the Geometry of Graeffe Iteration
inferred← citeshttps://doi.org/10.1006/jcom.2001.0607openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1006/jcom.2001.0612openalex-snapshot
Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives
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-68530-8_10openalex-snapshot
Complexity Estimates Depending on Condition and Round-Off Error
inferred← citeshttps://doi.org/10.1007/978-3-319-26721-0_16openalex-snapshot
Inexact Gauss-Newton Method for Singular Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-66320-3_28openalex-snapshot
Computing Multiple Zeros of Polynomial Systems: Case of Breadth One (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-540-70529-1_374openalex-snapshot
Newton-Raphson Method
inferred← citeshttps://doi.org/10.1007/978-3-642-48719-4_21openalex-snapshot
Comparative Statics and Algorithms for Finding Economic Equilibria
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_6openalex-snapshot
Condition Number Analysis for Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-44900-4_15openalex-snapshot
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving
inferred← citeshttps://doi.org/10.1007/pl00004896openalex-snapshot
Polar varieties and efficient real elimination
inferred← citeshttps://doi.org/10.1007/s00039-025-00699-wopenalex-snapshot
Optimal Transport Between Algebraic Hypersurfaces
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/s002080010017openalex-snapshot
The Distribution of Condition Numbers of Rational Data of Bounded Bit Length
inferred← citeshttps://doi.org/10.1007/s00211-010-0334-3openalex-snapshot
A continuation method to solve polynomial systems and its complexity
inferred← citeshttps://doi.org/10.1007/s10208-001-0049-zopenalex-snapshot
Implicit Gamma Theorems (I): Pseudoroots and Pseudospectra
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-0211-0openalex-snapshot
On Smale's 17th Problem: A Probabilistic Positive Solution
inferred← citeshttps://doi.org/10.1007/s10208-007-9017-6openalex-snapshot
Complexity of Bezout’s Theorem VI: Geodesics in the Condition (Number) Metric
inferred← citeshttps://doi.org/10.1007/s10208-007-9018-5openalex-snapshot
Complexity of Bezout’s Theorem VII: Distance Estimates in the Condition Metric
inferred← citeshttps://doi.org/10.1007/s10208-010-9078-9openalex-snapshot
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s10208-012-9134-8openalex-snapshot
On the Geometry and Topology of the Solution Variety for Polynomial System Solving
inferred← citeshttps://doi.org/10.1007/s10208-013-9155-yopenalex-snapshot
Smale’s Fundamental Theorem of Algebra Reconsidered
inferred← citeshttps://doi.org/10.1007/s10208-013-9171-yopenalex-snapshot
On the Expected Number of Zeros of Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/s10208-013-9185-5openalex-snapshot
Complexity of Path-Following Methods for the Eigenvalue Problem
inferred← citeshttps://doi.org/10.1007/s10208-016-9319-7openalex-snapshot
A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time
inferred← citeshttps://doi.org/10.1007/s10208-017-9358-8openalex-snapshot
Computing the Homology of Real Projective Sets
inferred← citeshttps://doi.org/10.1007/s10208-018-9375-2openalex-snapshot
Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric
inferred← citeshttps://doi.org/10.1007/s10208-019-09418-yopenalex-snapshot
Computing the Homology of Semialgebraic Sets. I: Lax Formulas
inferred← citeshttps://doi.org/10.1007/s10208-020-09483-8openalex-snapshot
Computing the Homology of Semialgebraic Sets. II: General Formulas
inferred← citeshttps://doi.org/10.1007/s10994-012-5323-6openalex-snapshot
Computational complexity of kernel-based density-ratio estimation: a condition number analysis
inferred← citeshttps://doi.org/10.1007/s11075-010-9426-5openalex-snapshot
On the solution of systems of equations with constant rank derivatives
inferred← citeshttps://doi.org/10.1007/s11075-011-9446-9openalex-snapshot
Extending the applicability of the Gauss–Newton method under average Lipschitz–type conditions
inferred← citeshttps://doi.org/10.1007/s11075-021-01199-2openalex-snapshot
On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
inferred← citeshttps://doi.org/10.1007/s11075-022-01253-7openalex-snapshot
Improved two-step Newton’s method for computing simple multiple zeros of polynomial systems
inferred← citeshttps://doi.org/10.1007/s11401-018-1070-8openalex-snapshot
Grid Methods in Computational Real Algebraic (and Semialgebraic) Geometry
inferred← citeshttps://doi.org/10.1007/s11784-009-0113-xopenalex-snapshot
Efficient polynomial system-solving by numerical methods
inferred← citeshttps://doi.org/10.1007/s11786-011-0069-2openalex-snapshot
Globally Convergent, Iterative Path-Following for Algebraic Equations
inferred← citeshttps://doi.org/10.1007/s40324-015-0036-yopenalex-snapshot
Local convergence analysis of inexact Gauss–Newton method for singular systems of equations under majorant and center-majorant condition
inferred← citeshttps://doi.org/10.1007/s40598-021-00182-yopenalex-snapshot
Real Lines on Random Cubic Surfaces
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00080-6openalex-snapshot
Optimal and nearly optimal algorithms for approximating polynomial zeros
inferred← citeshttps://doi.org/10.1016/j.aam.2011.07.001openalex-snapshot
A numerical algorithm for zero counting. III: Randomization and condition
inferred← citeshttps://doi.org/10.1016/j.amc.2024.129273openalex-snapshot
Branch points of homotopies: Distribution and probability of failure
inferred← citeshttps://doi.org/10.1016/j.cam.2007.07.006openalex-snapshot
Kantorovich's type theorems for systems of equations with constant rank derivatives
inferred← citeshttps://doi.org/10.1016/j.cam.2010.11.018openalex-snapshot
Condition number based complexity estimate for solving polynomial systems
inferred← citeshttps://doi.org/10.1016/j.jco.2004.09.010openalex-snapshot
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
inferred← citeshttps://doi.org/10.1016/j.jco.2008.01.001openalex-snapshot
On the probability distribution of data at points in real complete intersection varieties
inferred← citeshttps://doi.org/10.1016/j.jco.2008.03.001openalex-snapshot
A numerical algorithm for zero counting, I: Complexity and accuracy
inferred← citeshttps://doi.org/10.1016/j.jco.2010.01.003openalex-snapshot
Stochastic perturbations and smooth condition numbers
inferred← citeshttps://doi.org/10.1016/j.jco.2010.02.001openalex-snapshot
Convergence behavior of Gauss–Newton’s method and extensions of the Smale point estimate theory
inferred← citeshttps://doi.org/10.1016/j.jco.2011.11.005openalex-snapshot
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
inferred← citeshttps://doi.org/10.1016/j.jco.2013.04.005openalex-snapshot
An Arithmetic Poisson Formula for the multi-variate resultant
inferred← citeshttps://doi.org/10.1016/j.jco.2022.101668openalex-snapshot
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2016.03.023openalex-snapshot
Extended Newton methods for conic inequalities: Approximate solutions and the extended Smale α-theory
inferred← citeshttps://doi.org/10.1016/j.jpaa.2010.10.016openalex-snapshot
Numerical computation of the genus of an irreducible curve within an algebraic set
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/j.jsc.2016.07.015openalex-snapshot
What is numerical algebraic geometry?
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.01.002openalex-snapshot
TEMPORARY REMOVAL: On isolation of singular zeros of multivariate analytic systems
inferred← citeshttps://doi.org/10.1016/j.laa.2018.11.031openalex-snapshot
A comparison of eigenvalue condition numbers for matrix polynomials
inferred← citeshttps://doi.org/10.1016/j.laa.2025.10.009openalex-snapshot
Numerical instability of algebraic rootfinders
inferred← citeshttps://doi.org/10.1016/j.matpur.2006.06.001openalex-snapshot
Smoothed analysis of complex conic condition numbers
inferred← citeshttps://doi.org/10.1016/j.sigpro.2010.08.005openalex-snapshot
Structured total least squares approach for efficient frequency estimation
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.006openalex-snapshot
High probability analysis of the condition number of sparse polynomial systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.009openalex-snapshot
Deformation techniques to solve generalised Pham systems
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00015-7openalex-snapshot
Lower bounds for diophantine approximations
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00423-2openalex-snapshot
Perturbation theory for homogeneous polynomial eigenvalue problems
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00366-7openalex-snapshot
Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem
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/s0898-1221(96)00233-7openalex-snapshot
A fast and stable algorithm for splitting polynomials
inferred← citeshttps://doi.org/10.1017/cbo9781139107068.002openalex-snapshot
Smoothed Analysis of Condition Numbers
inferred← citeshttps://doi.org/10.1017/fmp.2023.7openalex-snapshot
Rigid continuation paths II. structured polynomial systems
inferred← citeshttps://doi.org/10.1017/fms.2015.2openalex-snapshot
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
inferred← citeshttps://doi.org/10.1017/s033427000000775xopenalex-snapshot
On the topology of parametric optimal control
inferred← citeshttps://doi.org/10.1017/s0962492900002774openalex-snapshot
Complexity theory and numerical analysis
inferred← citeshttps://doi.org/10.1023/a:1008348724781openalex-snapshot
Algebraic Geometry and Computer Vision: Polynomial Systems, Real and Complex Roots
inferred← citeshttps://doi.org/10.1080/01630560701348509openalex-snapshot
Newton's Method for Underdetermined Systems of Equations Under the γ-Condition
inferred← citeshttps://doi.org/10.1080/02331930008844502openalex-snapshot
Does optimality imply ill-posedness? some remarks about certain min-max optimization problems
inferred← citeshttps://doi.org/10.1080/10586458.2007.10129015openalex-snapshot
Constructing Hyperbolic Polyhedra Using Newton's Method
inferred← citeshttps://doi.org/10.1088/1361-6544/aa8ca8openalex-snapshot
Geometry of polynomials and root-finding via path-lifting
inferred← citeshttps://doi.org/10.1090/conm/604/12069openalex-snapshot
The complexity and geometry of numerically solving polynomial systems.
inferred← citeshttps://doi.org/10.1090/jams/938openalex-snapshot
Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
inferred← citeshttps://doi.org/10.1090/mcom/2993openalex-snapshot
On a condition number of general random polynomial systems
inferred← citeshttps://doi.org/10.1090/mcom/3479openalex-snapshot
On isolation of simple multiple zeros and clusters of zeros of polynomial systems
inferred← citeshttps://doi.org/10.1090/mcom/3757openalex-snapshot
Sampling and homology via bottlenecks
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01194-7openalex-snapshot
On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
inferred← citeshttps://doi.org/10.1090/s0025-5718-07-01963-1openalex-snapshot
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton’s method in the underdetermined case
inferred← citeshttps://doi.org/10.1090/s0025-5718-08-02060-7openalex-snapshot
The probability that a slightly perturbed numerical analysis problem is difficult
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02765-2openalex-snapshot
Fast computation of zeros of polynomial systems with bounded degree under finite-precision
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01114-xopenalex-snapshot
Multihomogeneous Newton methods
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01115-1openalex-snapshot
Newton’s method for overdetermined systems of equations
inferred← citeshttps://doi.org/10.1090/s0894-0347-08-00630-9openalex-snapshot
Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
inferred← citeshttps://doi.org/10.1093/imanum/23.3.395openalex-snapshot
Newton's method on Riemannian manifolds: covariant alpha theory
inferred← citeshttps://doi.org/10.1093/imanum/drac039openalex-snapshot
Complexity of sparse polynomial solving 2: renormalization
inferred← citeshttps://doi.org/10.1093/imanum/drs007openalex-snapshot
Adaptive step-size selection for homotopy methods to solve polynomial equations
inferred← citeshttps://doi.org/10.1109/ecc.2015.7330906openalex-snapshot
Homogeneity in control: Geometry and applications
inferred← citeshttps://doi.org/10.1137/1.9781611977073.49openalex-snapshot
Algorithmic Thresholds for Refuting Random Polynomial Systems
inferred← citeshttps://doi.org/10.1137/120885176openalex-snapshot
Approximate Solutions for Abstract Inequality Systems
inferred← citeshttps://doi.org/10.1137/16m1077222openalex-snapshot
Condition of Intersecting a Projective Variety with a Varying Linear Subspace
inferred← citeshttps://doi.org/10.1137/17m1151274openalex-snapshot
Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces
inferred← citeshttps://doi.org/10.1137/20m1323527openalex-snapshot
The Condition Number of Riemannian Approximation Problems
inferred← citeshttps://doi.org/10.1137/s0036144595288554openalex-snapshot
Solving a Polynomial Equation: Some History and Recent Progress
inferred← citeshttps://doi.org/10.1137/s105262349935606xopenalex-snapshot
Approximate Solutions of Analytic Inequality Systems
inferred← citeshttps://doi.org/10.1142/9789812778031_0015openalex-snapshot
COMPLEXITY ISSUES IN DYNAMIC GEOMETRY
inferred← citeshttps://doi.org/10.1145/1806689.1806759openalex-snapshot
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem
inferred← citeshttps://doi.org/10.1145/300515.300519openalex-snapshot
Complexity estimates depending on condition and round-off error
inferred← citeshttps://doi.org/10.1145/3208976.3209010openalex-snapshot
An Approach for Certifying Homotopy Continuation Paths
inferred← citeshttps://doi.org/10.1145/3275242openalex-snapshot
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
inferred← citeshttps://doi.org/10.1155/2014/498016openalex-snapshot
On Local Convergence Analysis of Inexact Newton Method for Singular Systems of Equations under Majorant Condition
inferred← citeshttps://doi.org/10.1155/2014/752673openalex-snapshot
An Analysis on Local Convergence of Inexact Newton-Gauss Method for Solving Singular Systems of Equations
inferred← citeshttps://doi.org/10.1155/2018/6768947openalex-snapshot
Kinematics Performance and Dynamics Analysis of a Novel Parallel Perfusion Manipulator with Passive Link
inferred← citeshttps://doi.org/10.1360/ssm-2019-0289openalex-snapshot
Symbolic-numeric methods oncomputing isolated singular solutions of algebraic systems
inferred← citeshttps://doi.org/10.1365/s13291-015-0117-yopenalex-snapshot
The Unavoidable Condition… A Report on the Book
inferred← citeshttps://doi.org/10.1515/gcc-2012-0004openalex-snapshot
Continuous hard-to-invert functions and biometric authentication
inferred← citeshttps://doi.org/10.18576/amis/160514openalex-snapshot
Optimal Path Homotopy For Univariate Polynomials
inferred← citeshttps://doi.org/10.4007/annals.2011.174.3.8openalex-snapshot
On a problem posed by Steve Smale
inferred← citeshttps://doi.org/10.4171/jems/789openalex-snapshot
A stable, polynomial-time algorithm for the eigenpair problem
inferred← citeshttps://doi.org/10.4310/cis.2012.v12.n3.a2openalex-snapshot
Spherical projective path tracking for homotopy continuation methods
inferred← citeshttps://doi.org/10.48550/arxiv.0812.2260openalex-snapshot
Average-Case Perturbations and Smooth Condition Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2642openalex-snapshot
Randomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2828openalex-snapshot
Complexity of Path-Following Methods for the Eigenvalue Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0036openalex-snapshot
Smale's Fundamental Theorem of Algebra reconsidered
inferred← citeshttps://doi.org/10.48550/arxiv.1403.4293openalex-snapshot
On a condition number of random polynomial systems
inferred← citeshttps://doi.org/10.48550/arxiv.1410.0116openalex-snapshot
A stable, polynomial-time algorithm for the eigenpair problem
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03981openalex-snapshot
Computing Simple Multiple Zeros of Polynomial Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07937openalex-snapshot
On isolation of singular zeros of multivariate analytic systems
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9608010openalex-snapshot
Lower Bounds for diophantine Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9609003openalex-snapshot
Polar Varieties and Efficient Real Equation Solving: The Hypersurface Case
inferred← citeshttps://doi.org/10.48550/arxiv.math/0012104openalex-snapshot
Random Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.48550/arxiv.math/0103093openalex-snapshot
On the uniform distribution of rational inputs with respect to condition numbers of Numerical Analysis
inferred← citeshttps://doi.org/10.70675/48fd7aa7z5156z4b70zb53cz3dd4e04fa79dopenalex-snapshot
Complexity issues in counting, polynomial evaluation and zero finding
inferred← citeshttps://doi.org/10.7468/jksmeb.2011.18.2.097openalex-snapshot
SEMILOCAL CONVERGENCE OF NEWTON'S METHOD FOR SINGULAR SYSTEMS WITH CONSTANT RANK DERIVATIVES
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.