Communication Complexity Towards Lower Bounds on Circuit Depth

13 years 8 months ago

Download www.cse.yorku.ca

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

Jeff Edmonds, Steven Rudich, Russell Impagliazzo,

Real-time Traffic

Bit Boolean Functions | Circuit Depth Complexity | FOCS 1991 | Theoretical Computer Science |

claim paper

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» Quantum Multiparty Communication Complexity and Circuit Lower Bounds

» Resistant Polynomials and Stronger Lower Bounds for DepthThree Arithmetical Formulas

» Deterministic Restrictions in Circuit Complexity

» Fast parallel circuits for the quantum Fourier transform

» TradeOff Lower Bounds for Stack Machines

» Cracks in the Defenses Scouting Out Approaches on Circuit Lower Bounds

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	FOCS
Authors	Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall

Comments (0)

Sciweavers

Communication Complexity Towards Lower Bounds on Circuit Depth

Bit Boolean Functions | Circuit Depth Complexity | FOCS 1991 | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers