Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
Work
Year: 2019
Type: article
Abstract: How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we p... more
Author Pierre Lairez
Institution École Polytechnique
Cites: 46
Cited by: 12
Related to: 10
FWCI: 1.318
Citation percentile (by year/subfield): 79.74
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze