## Lower Bounds for Deterministic and Nondeterministic Branching Programs (1991)

### Cached

### Download Links

- [genesis.mi.ras.ru]
- [people.cs.uchicago.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of the FCT'91, Lecture Notes in Computer Science |

Citations: | 57 - 4 self |

### BibTeX

@INPROCEEDINGS{Razborov91lowerbounds,

author = {Alexander A. Razborov},

title = {Lower Bounds for Deterministic and Nondeterministic Branching Programs},

booktitle = {in Proceedings of the FCT'91, Lecture Notes in Computer Science},

year = {1991},

pages = {47--60},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### 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. 1 Introduction The main goal of the Boolean complexity theory is to prove lower bounds on the complexity of computing "explicitly given" Boolean functions in interesting computational models. By "explicitly given" researchers usually mean "belonging to the class NP ". This is a very plausible interpretation since on the one hand this class contains the overwhelming majority of interesting Boolean functions and on the other hand it is small enough to prevent us from the necessity to take into account counting arguments. To illustrate the second point, let me remind the reader that already the class \Delta p 2 ,...