scientific article; zbMATH DE number 7503184

zbMath1483.05181MaRDI QIDQ5067999

Harald Andrés Helfgott

Publication date: 5 April 2022

Full work available at URL: https://smf.emath.fr/publications/expose-bourbaki-1125-isomorphismes-de-graphes-en-temps-quasi-polynomial-dapres-babai

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Group actions on combinatorial structures (05E18)

Related Items (5)

Two remarks on the vectorization problem ⋮ Normalisers of primitive permutation groups in quasipolynomial time ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ On short expressions for cosets of permutation subgroups ⋮ The Weisfeiler-Leman algorithm and the diameter of Schreier graphs

This page was built for publication: