Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Factoring Groups Efficiently

Neeraj Kayal and Timur Nezhmetdinov

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.

Details

Publication typeInproceedings
Published inInternational Colloquium on Automata, Languages and Programming (ICALP)
URLhttp://eccc.hpi-web.de/eccc-reports/2008/TR08-074/index.html
Volume5555
SeriesLecture Notes in Computer Science
ISBN978-3-642-02926-4
PublisherSpringer Verlag
> Publications > Factoring Groups Efficiently