Isomorphism testing of read-once functions and polynomials

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 problem in terms of the number of reads, as read-3 formula isomorphism problem is hard for \co\NP. We address the polynomial isomorphism problem, a special case of polynomial equivalence problem which in turn is important from a cryptographic perspective[Patarin EUROCRYPT'96, and Kayal SODA'11]. As our main result, we propose a deterministic polynomial time canonization scheme for polynomials computed by constant-free read-once arithmetic formulas. In contrast, we show that when the arithmetic formula is allowed to read a variable twice, this problem is as hard as the graph isomorphism problem.

[1]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

[2]  B. V. Raghavendra Rao,et al.  On the Complexity of Matroid Isomorphism Problems , 2009, CSR.

[3]  Carsten Damm,et al.  Problems Complete for +L , 1990, IMYCS.

[4]  Lisa Hellerstein,et al.  Learning Arithmetic Read-Once Formulas , 1995, SIAM J. Comput..

[5]  Jacobo Torán,et al.  Isomorphism Testing: Perspective and Open Problems , 2005, Bull. EATCS.

[6]  Steven Lindell.  A logspace algorithm for tree canonization (extended abstract) , 1992, STOC '92.

[7]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[8]  Matthias Hagen,et al.  Complexity of DNF minimization and isomorphism testing for monotone formulas , 2008, Inf. Comput..

[9]  Nitin Saxena,et al.  Equivalence of F-Algebras and Cubic Forms , 2006, STACS.

[10]  Manindra Agrawal,et al.  The Formula Isomorphism Problem , 2000, SIAM J. Comput..

[11]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[12]  Desh Ranjan,et al.  On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions , 1998, Theory of Computing Systems.

[13]  Ilya Volkovich,et al.  Improved Polynomial Identity Testing for Read-Once Formulas , 2009, APPROX-RANDOM.

[14]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.

[15]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[16]  Neeraj Kayal,et al.  Affine projections of polynomials , 2011, Electron. Colloquium Comput. Complex..

[17]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[18]  Nader H. Bshouty,et al.  Interpolating Arithmetic Read-Once Formulas in Parallel , 1998, SIAM J. Comput..

[19]  Nitin Saxena.  Automorphisms of Rings and Applications to Complexity , 2006 .

[20]  Peter Clote.  Boolean functions, invariance groups and parallel complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[21]  Nader H. Bshouty,et al.  On learning arithmetic read-once formulas with exponentiation (extended abstract) , 1994, COLT '94.

[22]  Neeraj Kayal,et al.  Efficient algorithms for some special cases of the polynomial equivalence problem , 2011, SODA '11.

[23]  Thomas Thierauf.  The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits , 1998, Chic. J. Theor. Comput. Sci..