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

.

##
###
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings

2017
*
International Symposium on Mathematical Foundations of Computer Science
*

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 [7], 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

doi:10.4230/lipics.mfcs.2017.38
dblp:conf/mfcs/ArvindDM017
fatcat:ehe7e6qbcrdljbtc6rltwaydaa