Farid Ablayev  Home/Search
Context Related
| ksu.ru/~fablayev/tcs.ps kcn.ru/~fablayev/tcs.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: ksu.ru/~fablayev/online (more) From: kcn.ru/~fablayev/online (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove three different types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion "probabilistic communication characteristic" that we define. We present boolean functions with the different probabilistic communication characteristics which demonstrates that each of these lower... (Update)
Context of citations to this paper: More
.... right away the we are not the first to apply information theory to obtain communication complexity results (see, e.g. [Raz92, NW93, Abl96, BGKL96, PRV99, CSWY01]) The main difference, however, is that all the above results use information theory as a tool in the proof (along...
...from L and does not read variables from L after starting reading variables from R. Then p (h) Gamma1 Now use the theorem proved in [1] which states that the randomized one way communication complexity cannot be too small for a function with a large data set and a...
Cited by: More
One-Way Communication Complexity of Symmetric Boolean.. - Arpe, Jakoby, Liskiewicz (2003) (Correct)
Two Applications of Information Complexity - Jayram, Kumar, Sivakumar (2003) (Correct)
An Information Statistics Approach to Data Stream.. - Bar-Yossef.. (2003) (Correct)
Active bibliography (related documents): More All
0.5: On the Impact of Forgetting on Learning Machines - Freivalds, al. (1995) (Correct)
0.4: Unbiased Bits from Sources of Weak Randomness and.. - Chor, Goldreich (1988) (Correct)
0.4: On Digital Images Which Cannot be Generated by Small.. - Litow, de Vel (1998) (Correct)
Similar documents based on text: More All
0.3: On quantum and probabilistic communication: Las Vegas and one-way .. - Klauck (2000) (Correct)
0.2: Randomization and Nondeterminsm Are Incomparable for Ordered.. - Ablayev (1997) (Correct)
0.2: Structure and Complexity - Allender, Schöning, Wagner (1996) (Correct)
Related documents from co-citation: More All
9: Some complexity questions related to distributive computing (context) - Yao - 1979
6: Cambridge university Press (context) - Kushilevitz, Nisan - 1996
6: Lower bounds by probabilistic arguments (context) - Yao - 1983
BibTeX entry: (Update)
F.Ablayev, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Theoretical Computer Science, 157, (1996), 139-159. http://citeseer.ist.psu.edu/article/ablayev96lower.html More
@article{ ablayev96lower,
author = "Farid Ablayev",
title = "Lower bounds for one-way probabilistic communication complexity and their application to space complexity",
journal = "Theoretical Computer Science",
volume = "157",
number = "2",
pages = "139--159",
year = "1996",
url = "citeseer.ist.psu.edu/article/ablayev96lower.html" }
Citations (may not include all citations):1911 Introduction to automata theory (context) - Hopcroft, Ullman - 1979
372 Information Theory and Reliable Communication (context) - Gallager - 1968
166 Some Complexity Questions Related to Distributive Computing (context) - Yao - 1979
145 Computational complexity of probabilistic Turing machines (context) - Gill - 1977
58 Lower Bounds by Probabilistic Arguments (context) - Yao - 1983
52 Information and Control (context) - Rabin, automata - 1963
44 Communication Complexity (context) - Papadimitrio, Sipser - 1983
41 Rounds in communication complexity revisited - Nisan, Wigderson - 1993
37 general weighted threshold gates (context) - Goldman, Hastad et al. - 1992
29 Lower bounds on Communication Complexity (context) - Duris, Galil et al. - 1984
22 VLSI Theory (context) - Lengauer - 1990
20 Communication Complexity: A Survey (context) - Lovasz - 1990
16 Probabilistic Communication Complexity (context) - Paturi, Simon - 1986
13 Lower bounds for one-way probabilistic communication complex.. - Ablayev - 1993
11 One-way log-tape reductions (context) - Hartmanis, Immerman et al. - 1978
9 Geometrical realization of set systems and probabilistic com.. (context) - Alon, Frankl et al. - 1985
6 Results on Communication Complexity Classes (context) - Lam, Ruzzo - 1992
5 Lower bounds for probabilistic space complexity: communicati.. (context) - Ablayev - 1994
3 On Comparing Probabilistic and Deterministic Automata Comple.. (context) - Ablayev - 1989
3 Information transfer under different sets of protocols (context) - Ja'Ja', Kumar et al. - 1984
2 Why sometimes probabilistic algorithms can be more effective (context) - Ablayev, Freivalds - 1986
1 Logic way of control of working of electric circuits (context) - Chegis, Jablonsky - 1958
1 Unibased bits from sources of weak randomness and probabilis.. (context) - Chor, Goldreich - 1988
1 Elektronische Informationsverarbeitung und Kybernetik (context) - Dieu, Condition et al. - 1972
1 On Different Models of Communication (context) - Halstenberg, Reischuk - 1988
1 On possibilities of syntesys of circuits based on arbitrary .. (context) - Lupanov - 1958
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ksu.ru/~fablayev/online.html): More
Randomization and Nondeterminsm Are Incomparable for Ordered.. - Ablayev (1997) (Correct)
On the Power of Randomized Ordered Branching Programs - Ablayev, Karpinski (1997) (Correct)
On the Power of Randomized Branching Programs - Ablayev, Karpinski (1996) (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