Joshua Grochow

Joshua Grochow is an Associate Professor in Computer Science at the University of Colorado Boulder, with joint appointments in Mathematics. His research spans theoretical computer science, algebraic complexity, and complex systems.

Key research areas:

• Algebraic approaches to matrix multiplication complexity
• Isomorphism problems for groups/tensors/polynomials
• Geometric complexity theory and circuit lower bounds
• Network analysis and complex systems modeling

Recent publications feature breakthroughs in tensor isomorphism completeness and parallel algorithms for group isomorphism. Research combines representation theory, combinatorics, and complexity theory.

Awards include Omidyar and Dean's Fellowships. Leads research groups in complexity theory and complex networks. Organizes workshops on wildness in computer science.