Thumbnail
Access Restriction
Subscribed

Author Raz, Ran ♦ Wigderson, Avi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Circuit depth ♦ Monotone computation ♦ Perfect matching
Abstract It is proven that monotone circuits computing the perfect matching function on $\textit{n}-vertex$ graphs require $&OHgr;(\textit{n})$ depth. This implies an exponential gap between the depth of monotone and nonmonotone circuits.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 39
Issue Number 3
Page Count 9
Starting Page 736
Ending Page 744


Open content in new tab

   Open content in new tab
Source: ACM Digital Library