Baby-step giant-step algorithms for the symmetric group
From MaRDI portal
Publication:2409009
DOI10.1016/j.jsc.2017.07.003zbMath1378.68199OpenAlexW2736271132MaRDI QIDQ2409009
Publication date: 10 October 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2017.07.003
Symbolic computation and algebraic computation (68W30) Symmetric groups (20B30) Group actions on combinatorial structures (05E18)
Uses Software
Cites Work
- An optimal lower bound on the number of variables for graph identification
- Complexity of a determinate algorithm for the discrete logarithm
- Practical graph isomorphism. II.
- Computation schemes for splitting fields of polynomials
- A Parallel Approach in Computing Correlation Immunity up to Six Variables
- On the order of magnitude of Jacobsthal's function
- ON THE PROBLEM OF JACOBSTHAL
- Monte Carlo Methods for Index Computation (mod p)
- Graph isomorphism in quasipolynomial time [extended abstract]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item