Code equivalence and group isomorphism

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1395-1408

  Babai, László ^a   Codenotti, Paolo ^a   Grochow, Joshua A ^a   Qiao, Youming ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); SET THEORY;

EXPONENTIAL TIME; HYPERGRAPH ISOMORPHISMS; ISOMORPHISM PROBLEMS; NILPOTENT GROUPS; PERMUTATION GROUP; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS;

POLYNOMIAL APPROXIMATION;

EID: 79955710406     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.107     Document Type: Conference Paper

References (37)

1. V. Arvind. Personal communication, 2010.
2. László Babai. Permutation groups, coherent configurations, and graph isomorphism. April 1983. D.Sc. Thesis, Hungarian Academy of Sci. (Hungarian).
3. László Babai. Trading group theory for randomness. In 17th STOC, pages 421-429. ACM Press, 1985.
4. László Babai. On the length of subgroup chains in the symmetric group. Communications in Algebra, 14:1729-1736, 1986.
5. László Babai. Bounded round interactive proofs in finite groups. SIAM J. Discr. Math., 5:88-111, 1992.
6. Laszlo Babai. Equivalence of linear codes. 2010. Unpublished manuscript.
7. Laszlo Babai. Coset intersection in moderately exponential time. Chicago J. Theoret. Comp. Sci., to appear.
8. László Babai and Robert Beals. A polynomial-time theory of black-box groups I. In C. M. Campbell, E. F. Robertson, N. Ruskuc, and G. C. Smith, editors, Groups St Andrews 1997 in Bath, I, volume 260 of London Math. Soc. Led. Notes, pages 30-64. Cambr. U. Press, 1999.
9. László Babai, Robert Beals, and Akos Seress. Polynomial-time theory of matrix groups. In 41st ACM STOC, pages 55-64. ACM Press, 2009.
10. László Babai, William M. Kantor, and Eugene M. Luks. Computational complexity and the classification of finite simple groups. In Proc. 24th IEEE FOCS, pages 162-171. IEEE Comp. Soc, 1983. (Pubitemid 14462516)
11. László Babai and Eugene M. Luks. Canonical labeling of graphs. In Proc. 15th ACM STOC, pages 171-183. ACM Press, 1983.
12. Laszlo Babai, Eugene M.Luks, and Akos Seress. Permutation groups in NC. In Proc. 19th ACM STOC, pages 409-420. ACM Press, 1987.
13. Laszlo Babai and Shlomo Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Computer and Sys. Sci., 36:254-276, 1988. (Pubitemid 18623335)
14. John Horton Conway, Robert Turner Curtis, Simon Phillips Norton, Richard A. Parker, and Robert Arnott Wilson.Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups. Oxford University Press, 1985.
15. Merrick L. Furst, John Hopcroft, and Eugene M. Luks. Polynomial-time algorithms for permutation groups. In Proc. 21st FOCS, pages 36-41. IEEE Comp. Soc, 1980.
16. Marek Golasiriski and Daciberg Lima Gongalves. Spherical space forms homotopy types and self-equivalences for groups. Topology and Appi, 146-147:451-470, 2005.
17. Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity, or all languages in up have zero-knowledge proof systems. J. ACM, 38:690-728, 1991.
18. Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems. In Silvio Micali, editor, Randomness and Computation, 1989.
19. Telikepalli Kavitha. Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Set., 73(6):986-996, 2007. (Pubitemid 46907094)
20. Neeraj Kayal and Timur Nezhmetdinov. Factoring groups efficiently. In ICALP'09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pages 585-596. Springer-Verlag, 2009. Also availabe as ECCC Tech Report TR08-074.
21. Donald E. Knuth. Efficient representation of perm groups. Combinatorica, 11:57-68, 1991.
22. Frangois Le Gall. Efficient isomorphism testing for a class of group extensions. In STACS, pages 625-636, 2009.
23. U. V. Linnik. On the least prime in an arithmetic progression. I. The basic theorem. Rec. Math. [Mat. Sbornik] N.S., 15(57):139-178, 1944.
24. Eugene M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comp. Sys. Sci., 25:42-65, 1982.
25. Eugene M. Luks. Computing the composition factors of a permutation group in polynomial time. Combinatorica, 7:87-99, 1987.
26. Eugene M. Luks. Hypergraph isomorphism and structural equivalence of boolean functions. In Proc. 31st ACM STOC, pages 652-658. ACM Press, 1999.
27. Gary L. Miller. On the n log n isomorphism technique (a preliminary report). In Proc. 10th ACM STOC, pages 51-58, New York, NY, USA, 1978. ACM Press.
28. Erez Petrank and Ron M. Roth. Is code equivalence easy to decide? IEEE Transactions on Information Theory, 43:1602-1604, 1997. (Pubitemid 127826441)
29. Derek J.S. Robinson. A Course in the Theory of Groups. Springer, 2nd edition, 1996.
30. 2) algorithm for abelian group isomorphism. Technical report, North Carolina State University, 1980.
31. Ákos Seress. Permutation Group Algorithms. Cambridge University Press, 2003.
32. Charles C. Sims. Computation with permutation groups. In S. R. Petrick, editor, Proc. 2nd Symp. Symb. Algeb. Manip., pages 23-28. ACM Press, 1971.
33. M. Suzuki. Group Theory I, II. Springer, 1982, 1986.
34. Narayan Vikas. An 0(n) algorithm for abelian p-group isomorphism and an 0(n log n) algorithm for abelian group isomorphism. J. Comput. Syst. Sci., 53(1):1-9, 1996. (Pubitemid 126358871)
35. James B. Wilson. Decomposing p-groups via Jordan algebras. J. Algebra, 322:2642-2679, 2009.
36. James B. Wilson. Finding central decompositions of p-groups. J. Group Theory, 12:813-830, 2009.
37. James B. Wilson. Finding direct product decompositions in polynomial time. 2010. Submitted for publication. Available as arXiv e-print 1005.0548.