On the computational complexity of the Abelian permutation group structure, membership and intersection problems
DOI10.1016/0304-3975(88)90078-3zbMATH Open0652.20001OpenAlexW1978556944MaRDI QIDQ1106934FDOQ1106934
Authors: 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
Recommendations
algorithmsorbitscyclic subgroupsbase elementintersection of permutation groupsmembership- relationproduct of cycles
Analysis of algorithms and problem complexity (68Q25) Subgroups of symmetric groups (20B35) Finite abelian groups (20K01) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group-theoretic algorithms and graph isomorphism
- Monte Carlo circuits for the abelian permutation group intersection problem
- Title not available (Why is that?)
- Fast parallel matrix and GCD computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of algorithms on problems in general abelian groups
- Title not available (Why is that?)
Cited In (8)
- A nonadaptive NC checker for permutation group intersection
- On the complexity of theories of permutations
- On the asymmetric complexity of the group-intersection problem
- The Parallel Complexity of Abelian Permutation Group Problems
- Title not available (Why is that?)
- Monte Carlo circuits for the abelian permutation group intersection problem
- On the complexity of some problems on groups input as multiplication tables
- Title not available (Why is that?)
This page was built for publication: On the computational complexity of the Abelian permutation group structure, membership and intersection problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106934)
