KRW Composition Theorems via Lifting

by   Susanna F. de Rezende, et al.

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., πβŠˆππ‚^1). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995) suggested to approach this problem by proving that depth complexity behaves "as expected" with respect to the composition of functions fβ™’ g. They showed that the validity of this conjecture would imply that πβŠˆππ‚^1. Several works have made progress toward resolving this conjecture by proving special cases. In particular, these works proved the KRW conjecture for every outer function f, but only for few inner functions g. Thus, it is an important challenge to prove the KRW conjecture for a wider range of inner functions. In this work, we extend significantly the range of inner functions that can be handled. First, we consider the monotone version of the KRW conjecture. We prove it for every monotone inner function g whose depth complexity can be lower bounded via a query-to-communication lifting theorem. This allows us to handle several new and well-studied functions such as the s-t-connectivity, clique, and generation functions. In order to carry this progress back to the non-monotone setting, we introduce a new notion of semi-monotone composition, which combines the non-monotone complexity of the outer function f with the monotone complexity of the inner function g. In this setting, we prove the KRW conjecture for a similar selection of inner functions g, but only for a specific choice of the outer function f.


page 1

page 2

page 3

page 4

βˆ™ 06/01/2023

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition

One of the major open problems in complexity theory is proving super-log...
βˆ™ 11/02/2019

A Solution of the P versus NP Problem based on specific property of clique function

Circuit lower bounds are important since it is believed that a super-pol...
βˆ™ 07/08/2023

On the Composition of Randomized Query Complexity and Approximate Degree

For any Boolean functions f and g, the question whether R(f∘ g) = Ξ˜Μƒ(R(f...
βˆ™ 02/12/2018

From expanders to hitting distributions and simulation theorems

Recently, Chattopadhyay et al. [chattopadhyay 2017 simulation] proved th...
βˆ™ 03/02/2018

Higher order monotonicity and submodularity of influence in social networks: from local to global

Kempe, Kleinberg and Tardos (KKT) proposed the following conjecture abou...
βˆ™ 08/26/2022

Randomised Composition and Small-Bias Minimax

We prove two results about randomised query complexity R(f). First, we i...
βˆ™ 01/05/2021

Methods for computing b-functions associated with ΞΌ-constant deformations – Case of inner modality 2 –

New methods for computing parametric local b-functions are introduced fo...

Please sign up or login with your details

Forgot password? Click here to reset