Umans, Chris

1. The Power of Quantum Fourier Sampling
   2015/07/20 by Fefferman, Bill, Umans, Chris · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
2. Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
   2016/06/14 by Zeyu Guo, Anand Kumar Narayanan, Guo, Zeyu +3 · 3 citations
   Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptographic Implementations and Security
3. Which groups are amenable to proving exponent two for matrix multiplication?
   2017/12/06 by Blasiak, Jonah, Church, Thomas, Cohn, Henry +2 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR)
4. Fast generalized DFTs for all finite groups
   2019/01/08 by Chris Umans, Umans, Chris · 1 citation
   Computer Science · Mathematics · #Data Structures and Algorithms (cs.DS) #Digital Filter Design and Implementation #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Mathematical Analysis and Transform Methods #Matrix Theory and Algorithms
5. Fast Multivariate Multipoint Evaluation Over All Finite Fields
   2022/04/30 by Vishwas Bhargava, Sumanta Ghosh, Bhargava, Vishwas +7 · 1 citation
   Computer Science · #Cryptography and Residue Arithmetic #Data Structures and Algorithms (cs.DS) #F.2.1 #FOS: Computer and information sciences #Numerical Methods and Algorithms #Polynomial and algebraic computation
6. Pseudorandomness of the Sticky Random Walk
   2023/07/18 by Emile Anand, Anand, Emile, Chris Umans +1 · 1 citation
   Computer Science · #Algorithms and Data Compression #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #Computational Complexity (cs.CC) #F.0 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #G.3 #Machine Learning and Algorithms #Probability (math.PR) #Spectral Theory (math.SP)