Pages that link to "Item:Q4303909"
From MaRDI portal
The following pages link to On the complexity of computation in finite Abelian, nilpotent and soluble groups (Q4303909):
Displaying 10 items.
- On complexity of multiplication in finite soluble groups. (Q468715) (← links)
- Computational complexity of immanents and representations of the full linear group (Q919059) (← links)
- Decidability and computability of certain torsion-free abelian groups (Q976537) (← links)
- On some measures of complexity of finite abelian groups (Q1675532) (← links)
- (Q3115682) (← links)
- Computational approaches to the theory of finite soluble groups (Q3774056) (← links)
- The computational complexity of torsion-freeness of finitely presented groups (Q4374809) (← links)
- (Q4470490) (← links)
- (Q4888936) (← links)
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS (Q5858922) (← links)