Monotone Circuits for Matching Require Linear Depth

Ran Raz, Avi Wigderson

Research output: Contribution to journalArticlepeer-review

102 Scopus citations

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 languageEnglish
Pages (from-to)736-744
Number of pages9
JournalJournal of the ACM
Volume39
Issue number3
DOIs
StatePublished - 7 Jan 1992

Keywords

  • circuit depth
  • monotone computation
  • perfect matching

Fingerprint

Dive into the research topics of 'Monotone Circuits for Matching Require Linear Depth'. Together they form a unique fingerprint.

Cite this