Article ID Journal Published Year Pages File Type
11021115 Information and Computation 2018 18 Pages PDF
Abstract
In this paper we study the complexity of factorization of polynomials in the free noncommutative ring F〈x1,x2,…,xn〉 of polynomials over the field F and noncommuting variables x1,x2,…,xn. Our main results are the following:
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the complexity of noncommutative polynomial factorization
Authors
, , ,