Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

Voted

FOCS
2008
IEEE

98views Theoretical Computer Science» more FOCS 2008»

The Unbounded-Error Communication Complexity of Symmetric Functions

15 years 9 months ago

The Unbounded-Error Communication Complexity of Symmetric Functions

Download userweb.cs.utexas.edu

Alexander A. Sherstov

Real-time Traffic

FOCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» UnboundedError OneWay Classical and Quantum Communication Complexity

» Silencebased communication

» Lower bounds for numberinhand multiparty communication complexity made easy

» A Direct Product Theorem for Discrepancy

» On distributing symmetric streaming computations

» Architectural Support for Fast SymmetricKey Cryptography

» Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates

» A LowCost Solution for Frequent Symmetric Key Exchange in Adhoc Networks

» A Key Establishment IPCore for Ubiquitous Computing

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	FOCS
Authors	Alexander A. Sherstov

Comments (0)