Factoring Groups Efficiently

Authors:
Neeraj Kayal;Timur Nezhmetdinov
Affiliations:
Microsoft Research Lab India, Bangalore, India 560080;Lehigh University, Pennsylvania, USA
Venue:
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Year:
2009

Citing 8
Cited 1

Permutation groups in NC

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Computing the composition factors of a permutation group in polynomial time

Combinatorica
Polynomial-time versions of Sylow's theorem

Journal of Algorithms
Finding Sylow normalizers in polynomial time

Journal of Algorithms
On the nlog n isomorphism technique (A Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Solvable Group Isomorphism is (almost) in NP " CoNP

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Linear time algorithms for Abelian group isomorphism and related problems

Journal of Computer and System Sciences
Computational complexity and the classification of finite simple groups

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science

Code equivalence and group isomorphism

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.