A lower bound on complexity of branching programs
Author:
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 480-489
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Bounds for Hodes - Specker theoremLecture Notes in Computer Science, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Bounds for width two branching programs1983
- Multi-party protocols1983
- $\Omega (n\log n)$ Lower Bounds on Length of Boolean FormulasSIAM Journal on Computing, 1982
- Parity, circuits, and the polynomial-time hierarchy1981
- Lengths of Formulas and Elimination of Quantifiers I1968