Lower bounds for deterministic and nondeterministic branching programs [chapter]

Alexander A. Razborov
1991 Lecture Notes in Computer Science  
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. * we will be using the word "device" to denote one of the two words "program" and "network"
doi:10.1007/3-540-54458-5_49 fatcat:tqfisfl5uba73egddzmtaoamwu