2 results
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 37 / Issue 1 / January 2003
- Published online by Cambridge University Press:
- 15 November 2003, pp. 51-66
- Print publication:
- January 2003
-
- Article
- Export citation
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 35 / Issue 2 / March 2001
- Published online by Cambridge University Press:
- 15 April 2002, pp. 149-162
- Print publication:
- March 2001
-
- Article
- Export citation