Factoring Groups Efficiently

Neeraj Kayal and Timur Nezhmetdinov

2009

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.

PDF file |

In International Colloquium on Automata, Languages and Programming (ICALP)

Publisher Springer Verlag

All copyrights reserved by Springer 2007.

Type | Inproceedings |

URL | http://eccc.hpi-web.de/eccc-reports/2008/TR08-074/index.html |

Volume | 5555 |

Series | Lecture Notes in Computer Science |

ISBN | 978-3-642-02926-4 |

> Publications > Factoring Groups Efficiently