2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2025
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
Chris Umans, Siki Wang
The fastest known algorithm for factoring a degree univariate polynomial over a finite field runs in time , and there is a re…
math.GR2024
Finite matrix multiplication algorithms from infinite groups
Jonah Blasiak, Henry Cohn, Joshua A. Grochow +2
The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group satisfying a s…
cs.DS2022★ 2 cited
Fast Multivariate Multipoint Evaluation Over All Finite Fields
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo +2
Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work…