On the computational complexity of the Abelian permutation group structure, membership and intersection problems

DOI10.1016/0304-3975(88)90078-3zbMath0652.20001OpenAlexW1978556944MaRDI QIDQ1106934

Costas S. Iliopoulos

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

zbMATH Keywords

algorithmsorbitscyclic subgroupsbase elementintersection of permutation groupsmembership- relationproduct of cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite abelian groups (20K01) Software, source code, etc. for problems pertaining to group theory (20-04) Subgroups of symmetric groups (20B35)

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

This page was built for publication: On the computational complexity of the Abelian permutation group structure, membership and intersection problems