Algorithmic theory of free solvable groups: randomized computations.
From MaRDI portal
Publication:402669
DOI10.1016/j.jalgebra.2014.02.014zbMath1336.20038arXiv1407.1691OpenAlexW2087202152MaRDI QIDQ402669
Publication date: 28 August 2014
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1691
word problemrandomized algorithmsmetabelian groupsconjugacy problemcyclic subgroup membership problemfree solvable groupsMonte Carlo type algorithmspower problem
Analysis of algorithms and problem complexity (68Q25) Solvable groups, supersolvable groups (20F16) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Randomized algorithms (68W20)
Related Items
Spherical quadratic equations in free metabelian groups, Magnus embedding and algorithmic properties of groups 𝐹/𝑁^{(𝑑)}
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quasilinear-time complexity theory
- Free differential calculus. III: Subgroups
- Topology of finite graphs
- Probabilistic algorithm for testing primality
- Combinatorial group theory.
- Stallings foldings and subgroups of free groups
- PRIMES is in P
- Free differential calculus. I: Derivation in the free group ring. II: The isomerphism problem of groups. III: Subgroups
- Free differential calculus. V: The Alexander matrices reexamined
- Fast multiplication of large numbers
- Free differential calculus. II: The isomorphism problem of groups
- Polynomial time conjugacy in wreath products and free solvable groups
- The Length of Elements in Free Solvable Groups
- GEOMETRICAL APPROACH TO THE FREE SOLVABLE GROUPS
- A Fast Monte-Carlo Test for Primality
- The word and geodesic problems in free solvable groups
- The Conjugacy Problem in Wreath Products and Free Metabelian Groups
