The following pages link to (Q5111252):
Displaying 4 items.
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- On the factorization of non-commutative polynomials (in free associative algebras) (Q2422708) (← links)