BibTeX
CSL-JSON
MLA
Harvard
Amortized communication complexity of an equality predicate
release_uwhdilxdw5caxnmwdauawx6e4m
by
Vladimir Nikishkin
Released
as a article
.
2012
Abstract
We study the communication complexity of a direct sum of independent copies
of the equality predicate. We prove that the probabilistic communication
complexity of this problem is equal to O(N); computational complexity of the
proposed protocol is polynomial in size of inputs. Our protocol improves the
result achieved in 1995(Feder, Kushilevitz, Naor, Nisan). Our construction is
based on two techniques: Nisan's pseudorandom generator (1992) and Smith's
string synchronization algorithm (2007).
In text/plain
format
Archived Files and Locations
application/pdf 185.7 kB
file_p72dy3xdsnd3pa7erhgexwknmm
|
archive.org (archive) |
Read Archived PDF
Preserved and Accessible
arXiv
1212.1941v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links