scientific article; zbMATH DE number 1305087
From MaRDI portal
Publication:4252029
zbMath0929.65028MaRDI QIDQ4252029
Publication date: 11 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmMonte Carlo methodnumber of real rootscomplexity boundssystem of polynomial equationscomplex rootsroot counting
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)
Related Items
Solving degenerate sparse polynomial systems faster, Toric intersection theory for affine root counting, Some speed-ups and speed limits for real algebraic geometry
