Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Previous
Next
Table of Contents
Related Articles
Home
Proceedings
CCC
CCC 2009
2009 24th Annual IEEE Conference on Computational Complexity
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Year: 2009, Pages: 341-350
DOI Bookmark:
10.1109/CCC.2009.32
Authors
Nikos Leonardos
Michael Saks
Download PDF
SHARE ARTICLE
Generate Citation
Abstract
