On the Isomorphism Problem for Decision Trees and Decision Lists

We study the complexity of isomorphism testing for Boolean functions that are represented by decision trees or decision lists. Our results include a $2^{\sqrt{s}(\lg s)^{O(1)}}$ time algorithm for isomorphism testing of decision trees of size s. Additionally, we show: · Isomorphism testing of rank-1 decision trees is complete for logspace. · For r≥2, isomorphism testing for rank-r decision trees is polynomial-time equivalent to Graph Isomorphism. As a consequence we obtain a ${2^{\sqrt{s}(\lg s)^{O(1)}}}$ time algorithm for isomorphism testing of decision trees of size s. · The isomorphism problem for decision lists admits a Schaefer-type dichotomy: depending on the class of base functions, the isomorphism problem is either in polynomial time, or equivalent to Graph Isomorphism, or coNP-hard.

[1]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[2]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[3]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[4]  Thomas Thierauf,et al.  The Computational Complexity of Equivalence and Isomorphism Problems , 2000, Lecture Notes in Computer Science.

[5]  Ronald L. Rivest,et al.  Learning decision lists , 2004, Machine Learning.

[6]  Heribert Vollmer,et al.  The Complexity of Boolean Constraint Isomorphism , 2003, STACS.

[7]  Jacobo Torán,et al.  Completeness results for graph isomorphism , 2003, J. Comput. Syst. Sci..

[8]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[9]  Manindra Agrawal,et al.  The Boolean isomorphism problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  László Babai,et al.  Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Johannes Köbler,et al.  The Isomorphism Problem for k-Trees Is Complete for Logspace , 2009, MFCS.

[12]  Eugene M. Luks,et al.  Hypergraph isomorphism and structural equivalence of Boolean functions , 1999, STOC '99.

[13]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[14]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

[15]  Jacobo Torán,et al.  Restricted space algorithms for isomorphism on bounded treewidth graphs , 2010, Inf. Comput..

[16]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[18]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[19]  Avrim Blum Rank-r Decision Trees are a Subclass of r-Decision Lists , 1992, Inf. Process. Lett..

[20]  Heribert Vollmer,et al.  Equivalence and Isomorphism for Boolean Constraint Satisfaction , 2002, CSL.

[21]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[22]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[23]  Sarnath Ramnath,et al.  On the isomorphism of expressions , 2000, Inf. Process. Lett..