90 citations · 330 across the 36 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013
Algorithms for group isomorphism via group extensions and cohomology
Joshua A. Grochow, Youming Qiao
The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in time, but only recently were polynomial-time algorithms designed…
math.CO2013★ 11 cited
Rotor-routing and spanning trees on planar graphs
Melody Chan, Thomas Church, Joshua A. Grochow
The sandpile group Pic^0(G) of a finite graph G is a discrete analogue of the Jacobian of a Riemann surface which was rediscovered several times in the contexts of arithmetic geome…
cs.CC2013★ 22 cited
Unifying and generalizing known lower bounds via geometric complexity theory
Joshua A. Grochow
We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity the…