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

E-ISSN： 1290-385x|37|1|51-66

ISSN： 0988-3754

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

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

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

By Bollig Beate

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 2, 2010-03 ,pp. : 149-162

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

Complexity of chemical graphs in terms of size, branching, and cyclicity

By Balaban A. T.

SAR and QSAR in Environmental Research, Vol. 17, Iss. 4, 2006-08 ,pp. : 429-466

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complexity results for prefix grammars

By Lohrey Markus Petersen Holger

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 2, 2010-03 ,pp. : 391-401

Edp Sciences

Access to resources Recommend Favorite

New complexity results on scheduling problem in a robotic cell

By Chikhi Nacira Abbas Moncef Benmansour Rachid Hanafi Saïd

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-08 ,pp. : 749-762

Edp Sciences

Access to resources Recommend Favorite