ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > FINITE GROUP:
Reports tagged with finite group:
TR08-074 | 19th July 2008
Neeraj Kayal, Timur Nezhmetdinov

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 subgroups A and B of G such that G is the direct product of A and B, if such ... more >>>



ISSN 1433-8092 | Imprint