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

E-ISSN： 1290-385x|35|2|149-162

ISSN： 0988-3754

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

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

A Lower Bound For Reversible Automata

By Héam Pierre-Cyrille

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 5, 2010-03 ,pp. : 331-341

Edp Sciences

Access to resources Recommend Favorite

Modelling integer linear programs with petri nets*

By Richard P.

RAIRO - Operations Research, Vol. 34, Iss. 3, 2010-03 ,pp. : 305-312

Edp Sciences

Access to resources Recommend Favorite

USING ASSET MANAGEMENT PROGRAMS TO LOWER CAPITAL COSTS

By Haskins Scott

Proceedings of the Water Environment Federation, Vol. 2005, Iss. 8, 2005-01 ,pp. : 7248-7256

Water Environment Federation

Access to resources Recommend Favorite

Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques

By Cherroun Hadda Darte Alain Feautrier Paul

RAIRO - Operations Research, Vol. 41, Iss. 4, 2007-10 ,pp. : 427-454

Edp Sciences

Access to resources Recommend Favorite