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

Author： Brosenne Henrik   Homeister Matthias   Waack Stephan  

Publisher： Edp Sciences

E-ISSN： 1290-385x|36|3|229-247

ISSN： 0988-3754

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

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

Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

By Bollig Beate  

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 1, 2010-03 ,pp. : 51-66

Edp Sciences

Access to resources Recommend Favorite

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

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

The Nonlinearity of Sum and Product for Boolean Functions

By  

MATEC Web of conference, Vol. 61, Iss. issue, 2016-06 ,pp. : 03005-03005

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