Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-02927-1_49 | ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I |
Keywords | Field | DocType |
direct product,multiplication table,polynomial time algorithm,factoring groups efficiently,finite group | Discrete mathematics,Mathematics,Factoring | Journal |
Volume | ISSN | Citations |
5555 | 0302-9743 | 1 |
PageRank | References | Authors |
0.39 | 11 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeraj Kayal | 1 | 263 | 19.39 |
| Timur Nezhmetdinov | 2 | 1 | 0.39 |