Communication Complexity Towards Lower Bounds on Circuit Depth

Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean

• Type: Conference
• Year: 1991
• Where: FOCS
• Authors: Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
• Keywords: Bit Boolean Functions, Circuit Depth Complexity, FOCS 1991, Theoretical Computer Science