Christopher Umans, Ph.D.

California Institute of Technology

Chris Umans works on complexity theory, algebraic algorithms, and randomness in computation. He has established new upper bounds for the complexity of matrix multiplication and has developed novel algorithms for polynomial factorization and for computing the generalized DFT.

Subscribe to MPS announcements and other foundation updates