activity
20152022
most citedComparing Information-Theoretic Measures of Complexity in Boltzmann Machines

19 citations · 34 across the 6 of their papers we have counts for

collaborators

12 papers

cs.CY202211 cited

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…

math.GR20222 cited

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…

nlin.CG2020

An Improved Algorithm for Coarse-Graining Cellular Automata

Yerim Song, Joshua A. Grochow

In studying the predictability of emergent phenomena in complex systems, Israeli & Goldenfeld (Phys. Rev. Lett., 2004; Phys. Rev. E, 2006) showed how to coarse-grain (elementary) c…

cs.CC2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

Peter A. Brooksbank, Joshua A. Grochow, Yinan Li +2

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically…

math.RT2018

Wildness for tensors

Vyacheslav Futorny, Joshua A. Grochow, Vladimir V. Sergeichuk

In representation theory, a classification problem is called wild if it contains the problem of classifying matrix pairs up to simultaneous similarity. The latter problem is consid…

cs.CC2018

Computational topology and the Unique Games Conjecture

Joshua A. Grochow, Jamie Tucker-Foltz

Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis…