Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
35
click to vote
STOC
1990
ACM
favorite
Email
discuss
report
96
views
Algorithms
»
more
STOC 1990
»
Monotone Circuits for Matching Require Linear Depth
14 years 3 months ago
Download
www.math.ias.edu
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 nonmonotone circuits.
Ran Raz, Avi Wigderson
Real-time Traffic
Algorithms
|
Exponential Gap
|
Monotone Circuits
|
Perfect Matching Function
|
STOC 1990
|
claim paper
Post Info
More Details (n/a)
Added
11 Aug 2010
Updated
11 Aug 2010
Type
Conference
Year
1990
Where
STOC
Authors
Ran Raz, Avi Wigderson
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision