Algorithmic theory of solvable groups
From MaRDI portal
Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Computational methods for problems pertaining to group theory (20-08)
Recommendations
- scientific article; zbMATH DE number 3897215
- Algorithmic theory of free solvable groups: randomized computations.
- scientific article; zbMATH DE number 67424
- Decision problems for soluble groups of finite rank
- Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. II
Cited in
(12)- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
- Algorithmic theory of free solvable groups: randomized computations.
- Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group
- An analysis of Makanin's algorithm deciding solvability of equations in free groups
- Computational approaches to the theory of finite soluble groups
- On decidability of the product of subgroups membership problem for nilpotent groups
- scientific article; zbMATH DE number 3897215 (Why is no real title available?)
- scientific article; zbMATH DE number 597711 (Why is no real title available?)
- scientific article; zbMATH DE number 3558069 (Why is no real title available?)
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
- Software for groups: theory and practice
- Algorithmically complex residually finite groups
This page was built for publication: Algorithmic theory of solvable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006737)
