| Issue |
RAIRO-Theor. Inf. Appl.
Volume 35, Number 3, May/June 2001
|
|
|---|---|---|
| Page(s) | 277 - 286 | |
| DOI | https://doi.org/10.1051/ita:2001120 | |
| Published online | 15 April 2002 | |
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
Institut für Informatik,
Ludwig-Maximilians-Universität München,
Oettingenstraße 67,
80538 München, Germany; e-mail: jjohanns@informatik.uni-muenchen.de
Received:
January
2001
Accepted:
8
August
2001
The depth hierarchy results for monotone circuits of Raz and McKenzie [5] are extended to the case of monotone circuits of semi-unbounded fan-in. It follows that the inclusions NCi ⊆ SACi ⊆ ACi are proper in the monotone setting, for every i ≥ 1.
Mathematics Subject Classification: 68Q17 / 68Q15
Key words: Monotone circuit / semi-unbounded fan-in / communication complexity / lower bound.
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.