activity
20162023
most citedAlgebraic dependencies and PSPACE algorithms in approximative complexity

2 citations · 6 across the 6 of their papers we have counts for

collaborators
Showing 2016 · cs.CCShow all

1 paper · 2 filters

cs.CC2016

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields

Zeyu Guo, Anand Kumar Narayanan, Chris Umans

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm.…