activity
20162022
most citedMatrix multiplication via matrix groups

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

collaborators
Showing 2016Show all

1 paper · 1 filter

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.…