Degree complexity of Boolean functions and its applications to relativized separations

It is shown that a simple function in AC/sup 0/, OR of square root n disjoint ANDs, cannot be computed by decision trees of depth log/sup O(1)/n where each node asks whether or not p(x/sub 1/, . . .,x/sub n/)=0 for some polynomial p of degree log/sup O(1)/n. This is in contrast to recent results that every function in AC/sup 0/ can be computed probabilistically by just one such query and can be deterministically computed by such decision trees if each node asks whether or not p(x/sub 1/, . . .,x/sub n/)>0. The proofs are based on simple algebraic arguments that also provide alternative proofs for some known results.<<ETX>>

[1]  Clemens Lautemann,et al.  BPP and the Polynomial Hierarchy , 1983, Inf. Process. Lett..

[2]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[3]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[4]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[5]  Richard Beigel,et al.  Relativized Counting Classes: Relations among Thresholds, Parity, and Mods , 1991, J. Comput. Syst. Sci..

[6]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Richard Beigelt,et al.  The Perceptron Strikes Back* preliminary report , 1991 .

[8]  James Aspnes,et al.  The expressive power of voting polynomials , 1991, STOC '91.

[9]  Marvin Minsky,et al.  Perceptrons: expanded edition , 1988 .

[10]  Jun Tarui.  Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy , 1991, STACS.

[11]  Mitsunori Ogihara,et al.  Counting classes are at least as hard as the polynomial-time hierarchy , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.