Construction of Very Hard Functions for Multiparty Communication Complexity

E-ISSN： 1290-385x|34|1|61-75

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.34, Iss.1, 2010-03, pp. : 61-75

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

One-way communication complexity of symmetric Boolean functions

By Arpe Jan Jakoby Andreas Liśkiewicz Maciej

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 4, 2010-03 ,pp. : 687-706

Edp Sciences

Access to resources Recommend Favorite

Three complexity functions

By Ferenczi Sébastien Hubert Pascal

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 1, 2012-03 ,pp. : 67-76

Edp Sciences

Access to resources Recommend Favorite

Diversity and Complexity in the Forms and Functions of Protected Areas in China

By Xu Jiliang Sun Gongqi Liu Ying

Journal of International Wildlife Law & Policy, Vol. 17, Iss. 3, 2014-07 ,pp. : 102-114

Routledge Ltd

Access to resources Recommend Favorite

Comparing Complexity Functions of a Language and Its Extendable Part

By Shur Arseny M.

RAIRO - Theoretical Informatics and Applications, Vol. 42, Iss. 3, 2008-06 ,pp. : 647-655

Edp Sciences

Access to resources Recommend Favorite

Communication Complexity and Lower Bounds on Multilective Computations

By Hromkovič Juraj

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 2, 2010-03 ,pp. : 193-212

Edp Sciences

Access to resources Recommend Favorite