Computational complexity and the classification of finite simple groups

By László Babai, William M. Kantor, Eugene M. Luks. 1983

Subfields: Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

1. B. Douglas

Citations in the corpus

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, background): “However the best current GI algorithm for general graphs has an upper bound of O(e √ nlogn) [8, 32, 6].”
• Practical graph isomorphism, II (2013, neutral): “√ The fastest proven running time for GI has stood for three decades at e O ( n log n ) (Babai et al., 1983).”
• Kodkod: A Relational Model Finder (2007, background): “1 equates the task of finding Sym(P ) to that of computing the automorphisms of the graphs that correspond to the constants in D—a problem with no known polynomial time solution [36].”