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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Kayal, N., & Nezhmetdinov, T. (2009). Factoring groups efficiently. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 585–596). https://doi.org/10.1007/978-3-642-02927-1_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free