A CFSG-free analysis of Babai's quasipolynomial GI-algorithm
L\'aszl\'o Pyber
TL;DR
This paper presents a modified version of Babai's graph isomorphism algorithm that achieves a weaker but still quasipolynomial time complexity, simplifying the original approach.
Contribution
It introduces a CFSG-free analysis of Babai's algorithm, providing a quasipolynomial time solution without relying on the Classification of Finite Simple Groups.
Findings
Achieves a quasipolynomial time complexity for graph isomorphism
Removes dependence on CFSG from Babai's analysis
Provides a simplified, weaker version of Babai's algorithm
Abstract
We obtain a weaker but still quasipolynomial version of Babai's famous GI-algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Mathematical Analysis and Transform Methods · Algebraic structures and combinatorial models