On random integer polynomials, the Descartes method isolates real roots in quasi-linear expected bit complexity, explaining a long-standing gap between worst-case theory and practical performance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms
On random integer polynomials, the Descartes method isolates real roots in quasi-linear expected bit complexity, explaining a long-standing gap between worst-case theory and practical performance.