12 citations · 93 across the 29 of their papers we have counts for
Showing 2013Show all
2 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…
cs.CC2013
Generalized Wong sequences and their applications to Edmonds' problems
Gábor Ivanyos, Marek Karpinski, Youming Qiao +1
We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linea…