Rigid continuation paths II. structured polynomial systems

This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with high probability, an approximate zero of a polynomi...

Full description

Saved in:

Bibliographic Details
Published in:	Forum of Mathematics, Pi Vol. 11
Main Authors:	Bürgisser, Peter, Cucker, Felipe, Lairez, Pierre
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.01.2023 Cambridge Univ Press
Subjects:	65H10 65H20 65Y20 68Q25 Algebra Algebraic Geometry Algorithms Approximation Complexity Computational Mathematics Computer Science Mathematics Numerical Analysis Polynomials Symbolic Computation 68Q25 65H10 65Y20 65H20
ISSN:	2050-5086, 2050-5086
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!