The Log-Rank Conjecture and low degree polynomials

We formulate several questions concerning the intersections of sets of Boolean roots of low degree polynomials. Two of these questions we show to be equivalent to the Log-Rank Conjecture from communication complexity. We further exhibit a slightly stronger formulation which we prove to be false, and a weaker formulation which we prove to be true. These results suggest a possible new approach to the Log-Rank Conjecture.

[1]  A. A. Razborov,et al.  The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear , 1992, Discret. Math..

[2]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Michael Saksl.  Lattices, MEbius Functions and Communication Complexity , 1988 .

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

[5]  Ran Raz,et al.  On the “log rank”-conjecture in communication complexity , 1995, Comb..

[6]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[7]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[8]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[9]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  Ran Raz,et al.  On the "log rank"-conjecture in communication complexity , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  Daniel A. Spielman,et al.  The perceptron strikes back , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.