90 citations · 330 across the 36 of their papers we have counts for
3 papers · 1 filter
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
Joshua A. Grochow, Michael Levet
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht--Fraïssé bijective pebble game in Hella's (Ann. Pure A…
Experience Report: Standards-Based Grading at Scale in Algorithms
Lijun Chen, Joshua A. Grochow, Ryan Layer +1
We report our experiences implementing standards-based grading at scale in an Algorithms course, which serves as the terminal required CS Theory course in our department's undergra…
Matrix multiplication via matrix groups
Jonah Blasiak, Henry Cohn, Joshua A. Grochow +2
In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of grou…