One-way communication complexity of symmetric Boolean functions

Author： Arpe Jan   Jakoby Andreas   Liśkiewicz Maciej  

Publisher： Edp Sciences

E-ISSN： 1290-385x|39|4|687-706

ISSN： 0988-3754

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

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

Construction of Very Hard Functions for Multiparty Communication Complexity

By Maňuch Ján  

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

Edp Sciences

Access to resources Recommend Favorite

Challenging the One-Way Paradigm for More Effective Science Communication: A Critical Review of Two Public Campaigns Addressing Contentious Environmental Issues

By McEntee Marie   Mortimer Claire  

Applied Environmental Education and Communication: an International Journal, Vol. 12, Iss. 2, 2013-04 ,pp. : 68-76

Routledge Ltd

Access to resources Recommend Favorite

Superiority of one-way and realtime quantum machines∗∗∗

By Yakaryılmaz Abuzer  

RAIRO - Theoretical Informatics and Applications, Vol. 46, Iss. 4, 2012-11 ,pp. : 615-641

Edp Sciences

Access to resources Recommend Favorite

Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs

By Brosenne Henrik   Homeister Matthias   Waack Stephan  

RAIRO - Theoretical Informatics and Applications, Vol. 36, Iss. 3, 2010-03 ,pp. : 229-247

Edp Sciences

Access to resources Recommend Favorite

On maximal QROBDD's of Boolean functions

By Michon Jean-Francis   Yunès Jean-Baptiste   Valarcher Pierre  

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

Edp Sciences

Access to resources Recommend Favorite