Monotone Circuits for Matching Require Linear Depth

13 years 8 months ago

Download www.math.ias.edu

We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.

Ran Raz, Avi Wigderson

Real-time Traffic

Algorithms | Exponential Gap | Monotone Circuits | Perfect Matching Function | STOC 1990 |

claim paper

» Powering requires threshold depth 3

» An Almost Optimal Rank Bound for Depth3 Identities

» Increasing depth resolution of Electron Microscopy of Neural circuits using Sparse Tomogra...

» Circuits with arbitrary gates for random operators

» Testing monotonicity of distributions over general partial orders

» Representing 0 1matrices by boolean circuits

» Using dynamic domino circuits in selftimed systems

» Protecting Circuits from Leakage the ComputationallyBounded and Noisy Cases

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	STOC
Authors	Ran Raz, Avi Wigderson

Comments (0)

Sciweavers

Monotone Circuits for Matching Require Linear Depth

Algorithms | Exponential Gap | Monotone Circuits | Perfect Matching Function | STOC 1990 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers