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 slides.com/jam...
Негізгі бет Ғылым және технология Nearly linear time isomorphism testing of groups of most orders
Пікірлер