Factoring groups efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 585-596

  Kayal, Neeraj ^a   Nezhmetdinov, Timur ^b  

^a MICROSOFT RESEARCH INDIA   (India)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECT PRODUCT; FINITE GROUPS; POLYNOMIAL-TIME ALGORITHMS;

LINGUISTICS; POLYNOMIAL APPROXIMATION;

TRANSLATION (LANGUAGES);

EID: 70449111701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_49     Document Type: Conference Paper

References (16)

1. Arvind, Toran: Solvable group isomorphism is (almost) in NP intersect coNP. In: Proceedings of the 19th Annual Conference on Computational Complexity, pp. 91-103 (2004)
2. Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: Proceedings of the 24th FOCS, pp. 162-171 (1979)
3. Babai, L., Seress, A., Luks, E.M.: Permutation groups in nc. In: Proceedings of 19th STOC, pp. 409-420 (1987)
4. Chen, L., Fu, B.: Linear and sublinear time algorithms for the basis of abelian groups. In: Electronic Colloquium on Computational Complexity, Technical report TR07-052 (2007)
5. Le Gall, F.: Efficient isomorphism testing for a class of group extensions. In: Proceedings of the annual Symposium on Theoretical Aspects of Computer Science (2009)
6. Herstein, I.N.: Topics in Algebra, 2nd edn. John Wiley & Sons, New York (1975)
7. Hulpke, A.: Gap project repository, http://www.math.colostate.edu/ ~hulpke/gapproj/projects.htm
8. Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73. Springer, New York (1974)
9. Kantor, W.M.: Polynomial-time algorithms for finding elements of prime order and sylow subgroups. Journal of Algorithms 6, 478-514 (1985)
10. Kantor, W.M.: Sylow's theorem in polynomial time. J. Comp. Syst. Sci. 30, 359-394 (1985)
11. Kantor, W.M.: Finding sylow normalizers in polynomial time. Journal of Algorithms 11, 523-563 (1990)
12. Kavitha, T.: Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6), 986-996 (2007)
13. Kantor, W.M., Taylor, D.E.: Polynomial-time versions of sylow's theorem. Journal of Algorithms 9, 1-17 (1988)
14. Luks, E.: Lectures on polynomial-time computation in groups, http://ix.cs.uoregon.edu/~luks
15. Luks, E.M.: Computing the composition factors of a permutation group in polynomial time. Combinatorica 7, 87-99 (1987)
16. Miller, G.: On the nlog n isomorphism technique. In: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)