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

.

##
###
Isomorphism testing of read-once functions and polynomials

2011
*
Foundations of Software Technology and Theoretical Computer Science
*

In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can be represented as OR of two or more monotone read-once formulas. This classifies the complexity of the

doi:10.4230/lipics.fsttcs.2011.115
dblp:conf/fsttcs/RaoS11
fatcat:vvc7ne4cubh2rkllnmeps2c4jm