Revision as of 21:20, 25 June 2025 edit ALittleClass (talk \| contribs) Extended confirmed users 928 edits →Consequences of the classification: added mention of graph isomorphism problem Tag: Visual edit ← Previous edit		Latest revision as of 09:21, 25 August 2025 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access=subscription updated in citation with #oabot.
Line 347: This section lists some results that have been proved using the classification of finite simple groups. A breakthrough in the best known theoretical algorithm for the [[graph isomorphism problem]] in 1982<ref>{{Cite journal \|last=Luks \|first=Eugene M. \|date=1982-08-01 \|title=Isomorphism of graphs of bounded valence can be tested in polynomial time \|url=https://www.sciencedirect.com/science/article/pii/0022000082900095 \|journal=Journal of Computer and System Sciences \|volume=25 \|issue=1 \|pages=42–65 \|doi=10.1016/0022-0000(82)90009-5 \|issn=0022-0000\|url-access=subscription }}</ref> The [[Schreier conjecture]] *The [[Signalizer functor theorem]]

Classification of finite simple groups: Difference between revisions