Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 71-77).by Stephen John Ponzio.Ph.D
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
AbstractWe first consider the so-called (1, +s)-branching programs in which along every consistent p...
We survey some upper and lower bounds established recently on the sizes of randomized branching prog...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
AbstractBranching programs are a well-established computation model for Boolean functions, especiall...
AbstractWe prove an exponential lower bound 2Ω(n/logn) on the size of any randomized ordered read-on...
AbstractAlmost the same types of restricted branching programs (or binary decision diagrams BDDs) ar...
Branching programs are a well-established computation model for Boolean functions, especially read-o...
AbstractRestricted branching programs are considered in complexity theory in order to study the spac...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
AbstractBy (1, + k(n))-branching programs (b.p.'s) we mean those b.p.'s which during each of their c...
. We define the notion of a randomized branching program in the natural way similar to the definitio...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
The replication number of a branching program is the minimum number R such that along every acceptin...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
AbstractWe first consider the so-called (1, +s)-branching programs in which along every consistent p...
We survey some upper and lower bounds established recently on the sizes of randomized branching prog...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
AbstractBranching programs are a well-established computation model for Boolean functions, especiall...
AbstractWe prove an exponential lower bound 2Ω(n/logn) on the size of any randomized ordered read-on...
AbstractAlmost the same types of restricted branching programs (or binary decision diagrams BDDs) ar...
Branching programs are a well-established computation model for Boolean functions, especially read-o...
AbstractRestricted branching programs are considered in complexity theory in order to study the spac...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
AbstractBy (1, + k(n))-branching programs (b.p.'s) we mean those b.p.'s which during each of their c...
. We define the notion of a randomized branching program in the natural way similar to the definitio...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
The replication number of a branching program is the minimum number R such that along every acceptin...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
AbstractWe first consider the so-called (1, +s)-branching programs in which along every consistent p...