MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

4 documents found, showing 1 through 4.

ATOM

Super-Logarithmic Depth Lower Bounds Via The Direct Sum In Communication Complexity
by Mauricio Karchmer, Ran Raz, Avi Wigderson, From Monotone P — 1991 — Proceedings of 6 th Structures in Complexity Theory
…SUPER-LOGARITHMIC DEPTH LOWER BOUNDS VIA THE DIRECT SUM IN COMMUNICATION COMPLEXITY Mauricio…
Cited by 21 (7 self) – Add To MetaCart

Fractional Covers and Communication Complexity (Extended Abstract)
by Mauricio Karchmer, E. Kushilevitz, N. Nisan, Krw Karchmer M, R. Raz, On Proving Super-logarithmic Depth Lower, Kw M. Karchmer, A. Wigderson, A. Wigderson, F \thetag D N — 1992
…, (1989). [KRW91] Karchmer M., R. Raz, and A. Wigderson, "On Proving Super-Logarithmic Depth Lower Bounds…
Add To MetaCart

[9] M. Karchmer, R. Raz, and A. Wigderson. On proving super-logarithmic depth lower bounds
by Theory Pages Annual
…[9] M. Karchmer, R. Raz, and A. Wigderson. On proving super-logarithmic depth lower bounds via…
Add To MetaCart

[Razborov 1990] A. A. Razborov, "On the Distributional Complexity of Disjointness ",
by Theoretical Computer Science
…. Wigderson, "On Proving Super-Logarithmic Depth Lower Bounds via the Direct Sum in Communication Complexity…
Add To MetaCart

Showing 1 through 4.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB