Abstract
We survey lower bounds established for the complexity of computing explicitly given Boolean functions by switching-and-rectifier networks, branching programs and switching networks. We first consider the unrestricted case and then proceed to various restricted models. Among these are monotone networks, bounded-width devices*, oblivious devices and read-k times only devices.
Cite
CITATION STYLE
Razborov, A. A. (1991). Lower bounds for deterministic and nondeterministic branching programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 529 LNCS, pp. 47–60). Springer Verlag. https://doi.org/10.1007/3-540-54458-5_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
