Ilan Newman, Mario Szegedy  Home/Search
Context Related
Links: ACM DBLP | cs.haifa.ac.il/ILAN/mariocc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.haifa.ac.il/IL...onlinepapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Ilan Newman and Mario Szegedy y Abstract We study 1-round two parties communication complexity games, where private random bits are used. We observe that the existence of good protocols for such games is related to a notion of approximating the matrix that represents the function by a certain low rank matrix. This gives rise to a new notion of rank, analogous of positive rank for 1-round communication complexity. We prove that the identity matrix is non approximable by low rank matrices... (Update)
Context of citations to this paper: More
...square root of the deterministic SM complexity of f . We found this result independently but subsequently to I. Newman and M. Szegedy [NS] who obtain this lower bound for the equality function. Our proof is also of interest for its simplicity; a proof in a similar spirit was...
Cited by: More
Randomized Simultaneous Messages - Babai, Kimmel (1996) (Correct)
Active bibliography (related documents): More All
0.5: Some Applications of Probability to Additive Number Theory and .. - Kolountzakis (1995) (Correct)
0.0: One-Way Communication Complexity And The Neciporuk Lower Bound on .. - Klauck (Correct)
0.0: Complexity Theoretical Results for Randomized Branching Programs - Sauerhoff (1999) (Correct)
Similar documents based on text: More All
0.1: On the Role of Algebra in the Efficient Verification of Proofs - Sudan (1994) (Correct)
0.1: Regular Languages are Testable with a Constant Number.. - Alon, Krivelevich.. (1999) (Correct)
0.1: Triangulations With Very Few Geometric Bistellar Neighbors - Santos (1998) (Correct)
BibTeX entry: (Update)
I. Newman, M. Szegedy. Public vs Private Coin Flips in One Round Communication Games. To Appear in: Proc. of the 28th ACM STOC, 1996. http://citeseer.ist.psu.edu/newman96public.html More
@inproceedings{ newman96public,
author = "Ilan Newman and Mario Szegedy",
title = "Public vs. private coin flips in one round communication games (extended abstract)",
pages = "561--570",
year = "1996",
url = "citeseer.ist.psu.edu/newman96public.html" }
Citations (may not include all citations):166 Some complexity questions related to distributive computing (context) - Yao - 1979
26 Communication complexity: a survey (context) - Lov'asz - 1990
25 Expressing combinatorial optimization problems by linear pro.. (context) - Yannakakis - 1988 ACM DBLP
25 Common Random bits in communication complexity (context) - Newman, vs - 1991
23 On Randomized One-Round Communication Complexity - Kremer, Nissan et al. ACM DBLP
14 towards a unified measure of complexity (context) - Yao, computation - 1977
2 Personal communication (context) - Bourgain, Wigderson
1 A survey on Communication Complexity (context) - Kuchilevitz, Nisan - 1995
Documents on the same site (http://cs.haifa.ac.il/ILAN/online-papers.html): More
Lower Bounds on Formula Size of Boolean Functions using.. - Newman, Wigderson (1996) (Correct)
Decision trees with Boolean threshold queries - Ben-Asher, Newman (1995) (Correct)
Cuts, Trees and l 1 -Embeddings of Graphs - Gupta, Newman, Rabinovich.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC