Lower bound methods for multiparty communication complexity

Not available === text

Bibliographic Details
Main Author:	Ford, Jeffrey Stephen
Format:	Others
Language:	English
Published:	2008
Subjects:	Combinatorial analysis Tensor products Computational complexity
Online Access:	http://hdl.handle.net/2152/2455

id	ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-2455
record_format	oai_dc
spelling	ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-24552015-09-20T16:50:53ZLower bound methods for multiparty communication complexityFord, Jeffrey StephenCombinatorial analysisTensor productsComputational complexityNot availabletext2008-08-28T22:49:53Z2008-08-28T22:49:53Z20062008-08-28T22:49:53ZThesiselectronicb61282728http://hdl.handle.net/2152/245572439636engCopyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works.
collection	NDLTD
language	English
format	Others
sources	NDLTD
topic	Combinatorial analysis Tensor products Computational complexity
spellingShingle	Combinatorial analysis Tensor products Computational complexity Ford, Jeffrey Stephen Lower bound methods for multiparty communication complexity
description	Not available === text
author	Ford, Jeffrey Stephen
author_facet	Ford, Jeffrey Stephen
author_sort	Ford, Jeffrey Stephen
title	Lower bound methods for multiparty communication complexity
title_short	Lower bound methods for multiparty communication complexity
title_full	Lower bound methods for multiparty communication complexity
title_fullStr	Lower bound methods for multiparty communication complexity
title_full_unstemmed	Lower bound methods for multiparty communication complexity
title_sort	lower bound methods for multiparty communication complexity
publishDate	2008
url	http://hdl.handle.net/2152/2455
work_keys_str_mv	AT fordjeffreystephen lowerboundmethodsformultipartycommunicationcomplexity
_version_	1716820224869662720

Lower bound methods for multiparty communication complexity

Similar Items