# KRW Composition Theorems via Lifting

Jakob Nordström

Electron. Colloquium Comput. Complex., pp. 992020.

Cited by: 0|Bibtex|Views41

Abstract:

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^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...More

Code:

Data:

Full Text