On the complexity of noncommutative polynomial factorization (Q6827798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6944930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of noncommutative polynomial factorization |
scientific article; zbMATH DE number 6944930 |
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
