Complexity and Randomness in Group Theory
From MaRDI portal
Publication:5112030
DOI10.1515/9783110667028OpenAlexW3206587220MaRDI QIDQ5112030
No author found.
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1702.01942
Probabilistic methods in group theory (20P05) Computational methods for problems pertaining to group theory (20-08)
Related Items (6)
Primitivity rank for random elements in free groups ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ The word problem for finitary automaton groups ⋮ An automaton group with \textsf{PSPACE}-complete word problem ⋮ Two problems for solvable and nilpotent groups
This page was built for publication: Complexity and Randomness in Group Theory
