The partition bound for classical communication complexity and query complexity

10.1109/CCC.2010.31

Saved in:

Bibliographic Details
Main Authors:	Jain, R., Klauck, H.
Other Authors:	COMPUTER SCIENCE
Format:	Conference or Workshop Item
Published:	2013
Subjects:	Communication complexity Linear programming Lower bounds Partition bound Query complexity
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/40841
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-40841
record_format	dspace
spelling	sg-nus-scholar.10635-408412023-10-26T08:42:53Z The partition bound for classical communication complexity and query complexity Jain, R. Klauck, H. COMPUTER SCIENCE Communication complexity Linear programming Lower bounds Partition bound Query complexity 10.1109/CCC.2010.31 Proceedings of the Annual IEEE Conference on Computational Complexity 247-258 2013-07-04T08:13:35Z 2013-07-04T08:13:35Z 2010 Conference Paper Jain, R., Klauck, H. (2010). The partition bound for classical communication complexity and query complexity. Proceedings of the Annual IEEE Conference on Computational Complexity : 247-258. ScholarBank@NUS Repository. https://doi.org/10.1109/CCC.2010.31 9780769540603 10930159 http://scholarbank.nus.edu.sg/handle/10635/40841 000286932700024 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
topic	Communication complexity Linear programming Lower bounds Partition bound Query complexity
spellingShingle	Communication complexity Linear programming Lower bounds Partition bound Query complexity Jain, R. Klauck, H. The partition bound for classical communication complexity and query complexity
description	10.1109/CCC.2010.31
author2	COMPUTER SCIENCE
author_facet	COMPUTER SCIENCE Jain, R. Klauck, H.
format	Conference or Workshop Item
author	Jain, R. Klauck, H.
author_sort	Jain, R.
title	The partition bound for classical communication complexity and query complexity
title_short	The partition bound for classical communication complexity and query complexity
title_full	The partition bound for classical communication complexity and query complexity
title_fullStr	The partition bound for classical communication complexity and query complexity
title_full_unstemmed	The partition bound for classical communication complexity and query complexity
title_sort	partition bound for classical communication complexity and query complexity
publishDate	2013
url	http://scholarbank.nus.edu.sg/handle/10635/40841
_version_	1781411101481631744

The partition bound for classical communication complexity and query complexity

Similar Items