The following pages link to (Q4888936):
Displaying 12 items.
- On complexity of multiplication in finite soluble groups. (Q468715) (← links)
- Computing representatives of nilpotent orbits of \(\theta\)-groups (Q629350) (← links)
- Computational complexity of immanents and representations of the full linear group (Q919059) (← links)
- On some measures of complexity of finite abelian groups (Q1675532) (← links)
- The collection formula of a nilpotent group of class 3 (Q3306566) (← links)
- On the complexity of computation in finite Abelian, nilpotent and soluble groups (Q4303909) (← links)
- The computational complexity of torsion-freeness of finitely presented groups (Q4374809) (← links)
- (Q4470490) (← links)
- The Computational Complexity to Evaluate Representations of General Linear Groups (Q4507382) (← links)
- (Q4731365) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
