Abstract
It is proven that monotone circuits computing the perfect matching function on n-vertex graphs require Ω1992 depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.
Original language | English |
---|---|
Pages (from-to) | 736-744 |
Number of pages | 9 |
Journal | Journal of the ACM |
Volume | 39 |
Issue number | 3 |
DOIs | |
State | Published - 7 Jan 1992 |
Keywords
- circuit depth
- monotone computation
- perfect matching