@inproceedings{kayal2009factoring,
author = {Kayal, Neeraj and Nezhmetdinov, Timur},
title = {Factoring Groups Efficiently},
series = {Lecture Notes in Computer Science},
booktitle = {International Colloquium on Automata, Languages and Programming (ICALP)},
year = {2009},
month = {January},
abstract = {We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B, if such a decomposition exists.},
publisher = {Springer Verlag},
url = {http://approjects.co.za/?big=en-us/research/publication/factoring-groups-efficiently/},
volume = {5555},
isbn = {978-3-642-02926-4},
edition = {International Colloquium on Automata, Languages and Programming (ICALP)},
}