Nearly linear time isomorphism testing of groups of most orders
Channel: James Wilson
Date: 2020-07-25

We present an algorithm to decide isomorphism of solvable groups on a dense set of orders in nearly-linear time.  We also consider applications to black-box groups.  

Joint work of Heiko Dietrich, Monash University and James B.Wilson, Colorado State University.

Slides at https://slides.com/jameswilson-3/group-isomorphism-of-most-orders/