TOWARD BETTER DEPTH LOWER BOUNDS: A KRW-LIKE THEOREM FOR STRONG COMPOSITION

One of the major open problems in complexity theory is proving superlogarithmic lower bounds on the depth of circuits (i.e., P ∕⊆ NC¹). [Karchmer, Raz, and Wigderson Super-logarithmic depth lower bounds via direct sum in communication complexity, in Proceedings of the Sixth Annual Structure in Complexity Theory Conference, IEEE Computer Society, Chicago, 1991, pp. 299-304] suggested approaching this problem by proving that the depth complexity of a composition of functions f ◇ g is roughly the sum of the depth complexities of f and g. They showed that the validity of this conjecture would imply that P ∕⊆ NC¹. The intuition that underlies the Karchmer, Raz, and Wigderson (KRW) conjecture is that the composition f ◇g should behave like a ``direct-sum problem"", in a certain sense, and, therefore, the depth complexity of f ◇g should be the sum of the individual depth complexities. Nevertheless, there are two obstacles toward turning this intuition into a proof: first, we do not know how to prove that f ◇ g must behave like a direct-sum problem; second, we do not know how to prove that the complexity of the latter direct-sum problem is indeed the sum of the individual complexities. In this work, we focus on the second obstacle. To this end, we study a notion called ``strong composition"", which is the same as f ◇ g except that it is forced to behave like a direct-sum problem. We prove a variant of the KRW conjecture for strong composition, thus overcoming the above second obstacle. This result demonstrates that the first obstacle above is the crucial barrier toward resolving the KRW conjecture. Along the way, we develop some general techniques that might be of independent interest.