Finding Integer Roots of Polynomials in Nearly Optimal Time
math.NT, cs.DS, cs.SC
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Fast Approximate Polynomial Multipoint Evaluation and Applications
- New data structure for univariate polynomial approximation and applications to root isolation, numerical multipoint evaluation, and other problems
- From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
- Faster Deterministic Integer Root Finding for Integer Polynomials
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models
- Asymptotic counting of integers with prime factors p r a s b