Access the full text.
Sign up today, get DeepDyve free for 14 days.
Hulya Duyan, Z. Halasi, Attila Mar'oti (2016)
A proof of Pyber's base size conjectureAdvances in Mathematics
A. Maróti (2002)
On the orders of primitive groupsJournal of Algebra, 258
M. Furst, J. Hopcroft, E. Luks (1980)
Polynomial-time algorithms for permutation groups21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
(2019)
bounds with explicit constants’, J
E. Luks (1980)
Isomorphism of graphs of bounded valence can be tested in polynomial time21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
Z. Halasi, M. Liebeck, A. Maróti (2018)
Base sizes of primitive groups: Bounds with explicit constantsJournal of Algebra
D. Holt, C. Roney-Dougal (2013)
Minimal and random generation of permutation and matrix groupsJournal of Algebra, 387
E. Luks, Takunari Miyazaki (2011)
Polynomial-time normalizersDiscret. Math. Theor. Comput. Sci., 13
E. Luks (1996)
Permutation Groups and Polynomial-Time Computation
R. Guralnick, Attila Mar'oti, L. Pyber (2016)
Normalizers of Primitive Permutation GroupsarXiv: Group Theory
L. Babai, E. Luks, Á. Seress (1987)
Permutation groups in NCProceedings of the nineteenth annual ACM symposium on Theory of computing
Harald HELFGOTT (2019)
Isomorphismes de graphes en temps quasi-polynomial (d’après Babai et Luks, Weisfeiler-Leman, ...)Astérisque
H. Helfgott (2017)
Isomorphismes de graphes en temps quasi-polynomial (d'apr\`es Babai et Luks, Weisfeiler-Leman...)arXiv: Group Theory
L. Babai (2015)
Graph isomorphism in quasipolynomial time [extended abstract]Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Peter Cameron, Michael Giudici, Gareth Jones, William Kantor, Mikhail Klin, D. Marušič (2019)
PERMUTATION GROUPSGroup Theory for Physicists
Daniel Wiebking (2019)
Normalizers and permutational isomorphisms in simply-exponential time
C. Sims (1970)
Computational methods in the study of permutation groups
We show that given generators for subgroups G and H of Sn, if G is primitive then generators for NH(G) may be computed in quasipolynomial time, namely 2O(log3n). The previous best known bound was simply exponential.
Bulletin of the London Mathematical Society – Wiley
Published: Apr 1, 2020
Keywords: ;
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.