Sciweavers

ICALP
2009
Springer
14 years 5 months ago
Factoring Groups Efficiently
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 su...
Neeraj Kayal, Timur Nezhmetdinov