Pages that link to "Item:Q1213972"
From MaRDI portal
The following pages link to Some algorithmic problems for solvable groups (Q1213972):
Displayed 11 items.
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm (Q915859) (← links)
- Model-theoretic and algorithmic questions in group theory (Q1063112) (← links)
- The conjugacy problem for centre-by-metabelian groups (Q1107628) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Infinite groups (Q1161607) (← links)
- Computable algebra and group embeddings (Q1170619) (← links)
- Finitely generated structures computable in polynomial time (Q2088618) (← links)
- Polynomially computable structures with finitely many generators (Q2213937) (← links)
- Some properties of elements of the group \(F/[N,N]\) (Q2412953) (← links)
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (Q2676823) (← links)
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865) (← links)