Monte Carlo circuits for the abelian permutation group intersection problem

DOI10.1007/BF00264315zbMath0615.68034OpenAlexW1996569247MaRDI QIDQ1820579

Costas S. Iliopoulos

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00264315

zbMATH Keywords

parallel computationbasispolynomial sizeabelian groups acting on n pointsabelian transitive permutation groupbounded number of generatorsgroup-theoretic computationsMonte Carlo Boolean circuit

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Computing a basis for a finite Abelian p-group
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• An O(logn) parallel connectivity algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monte Carlo circuits for the abelian permutation group intersection problem