A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings
[article]

2017
*
arXiv
*
pre-print

In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring F{x_1,x_2,...,x_n}. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10], and they showed lower bounds and proved completeness results. We consider Polynomial Identity Testing (PIT) and polynomial factorization over F{x_1,x_2,...,x_n} and show the following results. (1) Given an arithmetic circuit C of size s computing a

arXiv:1705.00140v2
fatcat:k7cermilhzawhn6qhcwlvbtwle