On the complexity of noncommutative polynomial factorization (Q1784944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of noncommutative polynomial factorization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of noncommutative polynomial factorization |
scientific article |
Statements
On the complexity of noncommutative polynomial factorization (English)
0 references
27 September 2018
0 references
polynomial factorization
0 references
noncommutative polynomials
0 references
arithmetic circuits
0 references
identity testing
0 references
complexity classes
0 references
