On the complexity of noncommutative polynomial factorization (Q1784944)
From MaRDI portal
scientific article; zbMATH DE number 6482796
- On the Complexity of Noncommutative Polynomial Factorization
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of noncommutative polynomial factorization |
scientific article; zbMATH DE number 6482796 |
|
Statements
On the complexity of noncommutative polynomial factorization (English)
0 references
On the Complexity of Noncommutative Polynomial Factorization (English)
0 references
27 September 2018
0 references
16 September 2015
0 references
polynomial factorization
0 references
noncommutative polynomials
0 references
arithmetic circuits
0 references
identity testing
0 references
complexity classes
0 references
0 references
