Results 1 
3 of
3
Monotone Circuits for Matching Require Linear Depth
"... We prove that monotone circuits computing the perfect matching function on nvertex graphs require\Omega\Gamma n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits. ..."
Abstract

Cited by 84 (9 self)
 Add to MetaCart
We prove that monotone circuits computing the perfect matching function on nvertex graphs require\Omega\Gamma n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.
Probabilistic communication complexity of boolean relations
 in \Proc. of 30th Annual IEEE Symp. on Foundations of Computer Science
, 1989
"... ..."
(Show Context)
vices. Monotone Circuits for Matching Require Linear Depth
, 2003
"... We prove that monotone circuits computing the perfect matching function on nvertex graphs require Ω(n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits. ..."
Abstract
 Add to MetaCart
We prove that monotone circuits computing the perfect matching function on nvertex graphs require Ω(n) depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.