36 citations · 196 across the 30 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.NA2020
Rigid continuation paths II. Structured polynomial systems
Peter Bürgisser, Felipe Cucker, Pierre Lairez
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously u…
cs.CG2020★ 4 cited
On the Complexity of the Plantinga-Vegter Algorithm
Felipe Cucker, Alperen A. Ergür, Josué Tonelli-Cueto
We introduce tools from numerical analysis and high dimensional probability for precision control and complexity analysis of subdivision-based algorithms in computational geometry.…