Sciweavers

STOC
1990
ACM
96views Algorithms» more  STOC 1990»
14 years 3 months ago
Monotone Circuits for Matching Require Linear Depth
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 non...
Ran Raz, Avi Wigderson