Efficient collection in infinite polycyclic groups.
From MaRDI portal
Publication:1864888
DOI10.1006/jsco.2002.0559zbMath1043.20018OpenAlexW2025760783MaRDI QIDQ1864888
Publication date: 23 March 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2002.0559
Symbolic computation and algebraic computation (68W30) Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
A parallel evolutionary approach to solving systems of equations in polycyclic groups, The status of polycyclic group-based cryptography: a survey and open problems, An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups, On complexity of multiplication in finite soluble groups., Using the Mal'cev correspondence for collection in polycyclic groups.
Uses Software
Cites Work