On the computational complexity of the Abelian permutation group structure, membership and intersection problems
From MaRDI portal
Publication:1106934
DOI10.1016/0304-3975(88)90078-3zbMath0652.20001MaRDI QIDQ1106934
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90078-3
algorithms; orbits; cyclic subgroups; base element; intersection of permutation groups; membership- relation; product of cycles
68Q25: Analysis of algorithms and problem complexity
20K01: Finite abelian groups
20-04: Software, source code, etc. for problems pertaining to group theory
20B35: Subgroups of symmetric groups
Cites Work
- Analysis of algorithms on problems in general abelian groups
- Group-theoretic algorithms and graph isomorphism
- Monte Carlo circuits for the abelian permutation group intersection problem
- Fast parallel matrix and GCD computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item