A direct product theorem for the two-party bounded-round public-coin communication complexity

A direct product theorem for the two-party bounded-round public-coin communication complexity

10.1109/FOCS.2012.42

Saved in:
Bibliographic Details
Main Authors: Jain, R., Pereszlenyi, A., Yao, P.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
bounded rounds
Communication complexity
direct product
information theory
Online Access:http://scholarbank.nus.edu.sg/handle/10635/40762
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-40762
record_format dspace
spelling sg-nus-scholar.10635-407622023-10-31T07:52:06Z A direct product theorem for the two-party bounded-round public-coin communication complexity Jain, R. Pereszlenyi, A. Yao, P. COMPUTER SCIENCE bounded rounds Communication complexity direct product information theory 10.1109/FOCS.2012.42 Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS 167-176 2013-07-04T08:11:45Z 2013-07-04T08:11:45Z 2012 Conference Paper Jain, R., Pereszlenyi, A., Yao, P. (2012). A direct product theorem for the two-party bounded-round public-coin communication complexity. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS : 167-176. ScholarBank@NUS Repository. https://doi.org/10.1109/FOCS.2012.42 02725428 http://scholarbank.nus.edu.sg/handle/10635/40762 000316999700019 Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic bounded rounds
Communication complexity
direct product
information theory
spellingShingle bounded rounds
Communication complexity
direct product
information theory
Jain, R.
Pereszlenyi, A.
Yao, P.
A direct product theorem for the two-party bounded-round public-coin communication complexity
description 10.1109/FOCS.2012.42
author2 COMPUTER SCIENCE
author_facet COMPUTER SCIENCE
Jain, R.
Pereszlenyi, A.
Yao, P.
format Conference or Workshop Item
author Jain, R.
Pereszlenyi, A.
Yao, P.
author_sort Jain, R.
title A direct product theorem for the two-party bounded-round public-coin communication complexity
title_short A direct product theorem for the two-party bounded-round public-coin communication complexity
title_full A direct product theorem for the two-party bounded-round public-coin communication complexity
title_fullStr A direct product theorem for the two-party bounded-round public-coin communication complexity
title_full_unstemmed A direct product theorem for the two-party bounded-round public-coin communication complexity
title_sort direct product theorem for the two-party bounded-round public-coin communication complexity
publishDate 2013
url http://scholarbank.nus.edu.sg/handle/10635/40762
_version_ 1781411098123042816

Similar Items