On short expressions for cosets of permutation subgroups
From MaRDI portal
Publication:2033478
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Subgroups of symmetric groups (20B35) General structure theorems for groups (20E34) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cites work
- A Remark on Stirling's Formula
- Effective bounds for certain functions concerning prime numbers
- Faster canonical forms for primitive coherent configurations (extended abstract)
- Finite Permutation Groups and Finite Simple Groups
- Graph isomorphism in quasipolynomial time (extended abstract)
- Graph isomorphisms in quasi-polynomial time [after Babai and Luks, Weisfeiler-Leman,\ldots]
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On the diameter of Cayley graphs of the symmetric group
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of doubly transitive permutation groups, elementary estimates
- On the orders of primitive groups
- The Finite Simple Groups
Cited in
(2)
This page was built for publication: On short expressions for cosets of permutation subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033478)