Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
APPROX
2008
Springer
favorite
Email
discuss
report
91
views
Algorithms
»
more
APPROX 2008
»
Improved Separations between Nondeterministic and Randomized Multiparty Communication
14 years 27 days ago
Download
www.cs.toronto.edu
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of communication for randomized number-on-forehead protocols with k =
Matei David, Toniann Pitassi, Emanuele Viola
Real-time Traffic
Algorithms
|
APPROX 2008
|
Explicit Function
|
Nondeterministic Number-on-forehead Protocol
|
Number-on-forehead Protocols
|
claim paper
Related Content
»
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
»
Exponential Separation of Quantum and Classical Noninteractive Multiparty Communication Co...
»
Lower Bounds on Quantum Multiparty Communication Complexity
»
Multiparty Computation with Low Communication Computation and Interaction via Threshold FH...
»
Flexible Group Key Exchange with Ondemand Computation of Subgroup Keys
»
Discrepancy and the Power of Bottom Fanin in Depththree Circuits
»
The Privacy of kNN Retrieval for Horizontal Partitioned Data New Methods and Applications
»
Wireless Medium Access via Adaptive Backoff Delay and Loss Minimization
more »
Post Info
More Details (n/a)
Added
12 Oct 2010
Updated
12 Oct 2010
Type
Conference
Year
2008
Where
APPROX
Authors
Matei David, Toniann Pitassi, Emanuele Viola
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision