Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
D Gavinsky, O Meir, O Weinstein… - Proceedings of the forty …, 2014 - dl.acm.org
D Gavinsky, O Meir, O Weinstein, A Wigderson
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014•dl.acm.orgOne of the major open problems in complexity theory is proving super-logarithmic lower
bounds on the depth of circuits (ie, P⊈ NC 1). This problem is interesting for two reasons:
first, it is tightly related to understanding the power of parallel computation and of small-
space computation; second, it is one of the first milestones toward proving super-polynomial
circuit lower bounds. Karchmer, Raz, and Wigderson [21] suggested to approach this
problem by proving the following conjecture: given two boolean functions f and g, the depth …
bounds on the depth of circuits (ie, P⊈ NC 1). This problem is interesting for two reasons:
first, it is tightly related to understanding the power of parallel computation and of small-
space computation; second, it is one of the first milestones toward proving super-polynomial
circuit lower bounds. Karchmer, Raz, and Wigderson [21] suggested to approach this
problem by proving the following conjecture: given two boolean functions f and g, the depth …
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., P ⊈ NC1). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small-space computation; second, it is one of the first milestones toward proving super-polynomial circuit lower bounds.
Karchmer, Raz, and Wigderson [21] suggested to approach this problem by proving the following conjecture: given two boolean functions f and g, the depth complexity of the composed function g o f is roughly the sum of the depth complexities of f and g. They showed that the validity of this conjecture would imply that P ⊈ NC1.
As a starting point for studying the composition of functions, they introduced a relation called "the universal relation", and suggested to study the composition of universal relations. This suggestion proved fruitful, and an analogue of the KRW conjecture for the universal relation was proved by Edmonds et. al. [12]. An alternative proof was given later by Håstad and Wigderson [18]. However, studying the composition of functions seems more difficult, and the KRW conjecture is still wide open.
In this work, we make a natural step in this direction, which lies between what is known and the original conjecture: we show that an analogue of the conjecture holds for the composition of a function with a universal relation. We also suggest a candidate for the next step and provide initial results toward it.
Our main technical contribution is developing an approach based on the notion of information complexity for analyzing KW relations -- communication problems that are closely related to questions on circuit depth and formula complexity. Recently, information complexity has proved to be a powerful tool, and underlined some major progress on several long-standing open problems in communication complexity. In this work, we develop general tools for analyzing the information complexity of KW relations, which may be of independent interest.
ACM Digital LibraryShowing the best result for this search. See all results