Communication complexity towards lower bounds on circuit depth
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Super-logarithmic depth lower bounds via direct sum in communication complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Monotone circuits for connectivity require super-logarithmic depthPublished by Association for Computing Machinery (ACM) ,1988
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- The Number of Two‐Terminal Series‐Parallel NetworksJournal of Mathematics and Physics, 1942