Graph isomorphism in quasipolynomial time: [Extended abstract]

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 19-21-June-2016, Issue , 2016, Pages 684-697

  Babai, László ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Algorithms; Complexity of computation; Divide and conquer; Graph isomorphism; Graphs; Group theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY;

DIVIDE AND CONQUER; DIVIDE-AND-CONQUER ALGORITHM; EXTENDED ABSTRACTS; GRAPH ISOMORPHISM; GRAPHS; PARTITIONING TECHNIQUES; QUASI-POLYNOMIAL TIME; RELATIONAL STRUCTURES;

GROUP THEORY;

EID: 84979238750     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2897518.2897542     Document Type: Conference Paper

References (68)

1. V. ARVIND AND JACOBO TORÁN: Isomorphism testing: Perspectives and open problems. Bull. EATCS 86, June 2005.
2. MICHAEL ASCHBACHER AND LEONARD L. SCOTT: Maximal subgroups of finite groups. J. Algebra 92(1985), 44-80.
3. ALBERT ATSERIAS AND ELITZA MANEVA: Graph Isomorphism, Sherali-Adams Relaxations and Indistinguishability in Counting Logics. SIAM J. Comp. 42(1), 2013, 112-137.
4. LÁSZLÓ BABAI: On the isomorphism problem. Manuscript, 1977. Cited in [Mat]
5. LÁSZLÓ BABAI: Monte Carlo algorithms in graph isomorphism testing. Tech. Rep. 79-10, Dep. Math. et Stat., Universite de Montreal, 1979 (pp. 42) http://people. cs.uchicago.edu/~laci/lasvegas79.pdf
6. LÁSZLÓ BABAI: Lectures on Graph Isomorphism. University of Toronto, Department of Computer Science. Mimeographed lecture notes, October 1979
7. LÁSZLÓ BABAI: On the order of uniprimitive permutation groups. Annals of Math. 113 (3) (1981) 553-568.
8. LÁSZLÓ BABAI: Permutation Groups, Coherent Configurations and Graph Isomorphism. D. Sc. Thesis (Hungarian), Hungarian Academy of Sciences, April 1983.
9. LÁSZLÓ BABAI: Coset intersection in moderately exponential time. Manuscript, 2008. http://people. cs.uchicago.edu/~laci/int.pdf
10. LÁSZLÓ BABAI: Graph Isomorphism in quasipolynomial time. arXiv: 1512.03547, 2015.
11. LÁSZLÓ BABAI, PETER J. CAMERON, PÉTER P. PÁLFY: On the orders of primitive groups with restricted nonabelian composition factors. J. Algebra 79 (1982) 161-168.
12. LÁSZLÓ BABAI, XI CHEN, XIAORUI SUN, SHANG-HUA TENG, JOHN WILMES: Faster Canonical Forms For Strongly Regular Graphs. In: 54th IEEE FOCS, 2013, pp. 157-166.
13. LÁSZLÓ BABAI, PAOLO CODENOTTI: Isomorphism of hypergraphs of low rank in moderately exponential time. In: Proc. 49th IEEE FOCS, 2008, pp. 667-676.
14. LÁSZLÓ BABAI, PAOLO CODENOTTI, JOSHUA A. GROCHOW, YOUMING QIAO: Code Equivalence and Group Isomorphism. In: Proc. 22nd Ann. Symp. on Discrete Algorithms (SODA'11), ACM-SIAM, 2011, pp. 1395-1408.
15. LÁSZLÓ BABAI, PAOLO CODENOTTI, YOUMING QIAO: Polynomial-time Isomorphism Test for Groups with no Abelian Normal Subgroups (Extended Abstract). In: Proc. 39th Internat. Colloq. on Automata, Languages and Programming (ICALP'12), Springer LNCS 7391, 2012, pp. 51-62.
16. LÁSZLÓ BABAI, WILLIAM M. KANTOR, EUGENE M. LUKS: Computational complexity and the classification of finite simple groups. In: Proc. 24th IEEE FOCS, 1983, pp. 162-171.
17. LÁSZLÓ BABAI, EUGENE M. LUKS: Canonical labeling of graphs. In: Proc. 15th ACM STOC, 1983, pp. 171-183.
18. LÁSZLÓ BABAI, EUGENE M. LUKS, AKOS SERESS: Permutation groups in NC. In: Proc. 19th ACM STOC, 1987, pp. 409-420.
19. LÁSZLÓ BABAI, PÉTER P. PÁLFY, JAN SAXL: On the number of p-regular elements in finite simple groups. LMS J. Comput. and Math., 12 (2009) 82-119.
20. LÁSZLÓ BABAI, AKOS SERESS: On the degree of transitivity of permutation groups: a short proof. J. Combinatorial Theory-A 45 (1987) 310-315.
21. LÁSZLÓ BABAI, JOHN WILMES: Quasipolynomial-time canonical form for Steiner designs. In: Proc. 45th ACM STOC, 2013, pp. 261-270.
22. LÁSZLÓ BABAI, JOHN WILMES: Asymptotic Delsarte cliques in distance-regular graphs. J. Algebraic Combinatorics, to appear. See arXiv:1503.02746
23. ALFRED BOCHERT: Über die Zahl verschiedener Werthe, die eine Funktion gegebener Buchstaben durch Vertauschung derselben erlangen kann. Math. Ann. 33 (1889) 584-590.
24. ALFRED BOCHERT: Math. Ann. 40 (1892) 176-193
25. ALFRED BOCHERT: Über die Classe der transitiven Substitutionengruppen II. Math. Ann. 49 (1897) 133-144.
26. JIN-YI CAI, MARTIN FÜRER, NEIL IMMERMAN: An optimal lower bound on the number of variables for graph identification. Combinatorica 12 (1992) 389-410.
27. PETER J. CAMERON: Finite permutation groups and finite simple groups, Bull. London Math Soc. 13 (1981) 1-22.
28. XI CHEN, XIAORUI SUN, SHANG-HUA TENG: Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems. In: Proc. 45th ACM STOC, 2013, pp. 271-280.
29. JOHN D. DIXON, BRIAN MORTIMER: Permutation Groups. Springer Grad. Texts in Math. vol. 163, 1996
30. WALTER FEIT AND JACQUES TITS: Projective representations of minimum degree of group extensions. Canad. J. Math. 30 (1978) 1092-1102.
31. MERRICK FURST, JOHN HOPCROFT, EUGENE LUKS: Polynomial-time algorithms for permutation groups. In: Proc. 21st IEEE FOCS, 1980, pp. 36-41.
32. GEORGE GLAUBERMAN AND ŁUKASZ GRABOWSKI: Groups with identical k-profiles. Theory of Computing 11 (15) (2015) 395-401
33. ODED GOLDREICH, SILVIO MICALI, AND AVI WIGDERSON: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: Proc. 27th IEEE FOCS, 1986, pp. 174-187.
34. NEIL IMMERMAN, ERIC S. LANDER: Describing graphs: a first-order approach to graph canonization. In: Complexity Theory Retrospective - in honor of Juris Hartmanis on the occasion of his 60th birthday, July 5, 1988 (Alan Selman, ed.), Springer 1990, pp. 59-81.
35. CAMILLE JORDAN: Traite des substitutions et des equations algebriques. Gauthier-Villars, 1870. (Reprinted 1957, Paris, Albert Blanchard)
36. CAMILLE JORDAN: Nouvelles recherches sur la limite de transivité des groupes qui ne contiennent pas le groupe alterne. J. de Math. Pures et Appliquées 1(1895), 35-60.
37. PETER KLEIDMAN AND MARTIN LIEBECK: The Subgroup Structure of the Finite Classical Groups. London Math. Soc. Lecture Note Ser. Vol. 129, Cambridge Univ. Press, 1990.
38. DONALD E. KNUTH: Efficient representation of perm groups. Combinatorica 11 (1991) 57-68.
39. MARTIN W. LIEBECK: On graphs whose full automorphism group is an alternating group or a finite classical group. Proc. London Math. Soc. (3) 47 (1983) 337-362
40. MARTIN W. LIEBECK, CHERYL E. PRAEGER, JAN SAXL: On the O'Nan-Scott theorem for finite primitive permutation groups. J. Austral. Math. Soc. (A) 44 (1988) 389-396
41. EUGENE M. LUKS: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25 (1) (1982) 42-65.
42. EUGENE M. LUKS: Computing the composition factors of a permutation group in polynomial time. Combinatorica 7 (1987) 87-99.
43. EUGENE M. LUKS: Permutation groups and polynomial-time computation. In: Groups and Computation, DIMACS Ser. in Discr. Math. and Theor. Computer Sci. 11 (1993) 139-175.
44. EUGENE M. LUKS: Hypergraph Isomorphism and Structural Equivalence of Boolean Functions. In: 31st ACM STOC, 1999, pp. 652-658.
45. ATTILA MARÓTI: On the orders of primitive groups. J. Algebra 258 (2) (2002) 631-640.
46. RUDI MATHON: A note on the graph isomorphism counting problem. Info. Proc. Lett. 8 pp. 131-132.
47. BRENDAN D. MCKAY AND ADOLFO PIPERNO: Practical Graph Isomoprhism, II. arXiv: 1301.1493, 2013.
48. TAKUNARI MIYAZAKI: Luks's reduction of Graph isomorphism to code equivalence. Comment on The Math Forum, Sep. 29, 1996. http://mathf orum.org/kb/thread. jspa? forumID=253&threadID=561418& messageID=1681072# 1681072
49. DANIEL NEUEN, PASCAL SCHWEITZER: Iterated CFI graphs. Personal communication by P. S., 2015.
50. RYAN O'DONNELL, JOHN WRIGHT, CHENGGANG WU, YUAN ZHOU: Hardness of robust graph isomorphism, Lasserre gaps, and asymmetry of random graphs. In: Proc. 25th ACM-SIAM Symp. Disr. Alg. (SODA'14), 2014, pp. 1659-1677.
51. ADOLFO PIPERNO: Search Space Contraction in Canonical Labeling of Graphs. arXiv:0804.4881, 2008, v2 2011.
52. LÁSZLÓ PYBER: On the orders of doubly transitive permutation groups, elementary estimates. J. Combinatorial Theory, Ser A 62 (2) (1993) 361-366.
53. LÁSZLÓ PYBER: Personal comunication, 2016.
54. JOSEPH ROTMAN: An Introduction to the Theory of Groups. 4th ed., Springer, 1995.
55. LEONARD L. SCOTT: Representations in characteristic p. In: The Santa Cruz Conference on Finite Groups, 1980, Amer. Math. Soc, 3ppp. 319-322.
56. ÁKOS SERESS: Permutation Group Algorithms. Cambridge Univ. Press, 2003
57. nd Symp. Symb. Algeb. Manip. (S. R. Petrick, ed.), ACM, New York, 1971, pp. 23-28.
58. CHARLES C. SIMS: Some group theoretic algorithms. In: Lecture Notes in Math. Vol. 697, Springer, 1978, pp. 108-124.
59. AARON SNOOK, GRANT SCHOENEBECK, PAOLO CODENOTTI: Graph Isomorphism and the Lasserre Hierarchy. arXiv:1401.0758
60. DANIEL A. SPIELMAN: Faster Isomorphism Testing of Strongly regular Graphs. In: Proc. 28th ACM STOC, 1996, pp. 576-584.
61. XIAORUI SUN AND JOHN WILMES: Faster canonical forms for primitive coherent configurations. In: Proc. 47th STOC, 2015, pp. 693-702.
62. JACOBO TORÁN: On the hardness of Graph Isomorphism. SIAM J. Comp. 33 (5) (2004) n1093-1108
63. BORIS WEISFEILER (ed.): On Construction and Identification of Graphs. Springer Lect. Notes in Math. Vol 558, 1976.
64. BORIS WEISFEILER, ANDREI A. LEMAN: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsiya 9 (1968) 12-16.
65. HELMUT WIELANDT: Abschätzungen für den Grad einer Permutationsgruppe von vorgeschriebenem Transitivitätsgrad. Dissertation, Berlin, 1934. Schriften Math. Seminars Inst. Angew. Math. Univ. Berlin 2 (1934) 151-174.
66. HELMUT WIELANDT: Über den Transitivitätsgrad von Permutationsgruppen. Math. Z. 74 (1960) 297-298.
67. HELMUT WIELANDT: Finite Permutation Groups. Acad. Press, New York 1964.
68. VIKTOR N. ZEMLYACHENKO, NIKOLAI M. KORNEENKO, REGINA I. TYSHKEVICH: Graph isomorphism problem. Zapiski Nauchnykh Seminarov LOMI 118 (1982) 83-158, 215.