Presents an improved Montes algorithm for local polynomial factorization achieving almost optimal complexity via new Hensel extensions and approximate roots when residual characteristic is zero or high.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Local polynomial factorisation: improving the Montes algorithm
Presents an improved Montes algorithm for local polynomial factorization achieving almost optimal complexity via new Hensel extensions and approximate roots when residual characteristic is zero or high.