AbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching programs we separate the logarithmic space-bounded complexity classes Le, NLe, co-NLe and Pe for eraser Turing machines
AbstractBy (1, + k(n))-branching programs (b.p.'s) we mean those b.p.'s which during each of their c...
AbstractInput oblivious decision graphs of linear length are considered. Among other concerns the co...
AbstractWe prove the first lower bounds for restricted read-once parity branching programs with unli...
AbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching pro...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
AbstractWe present a new method for proving lower bounds on the complexity of branching programs and...
AbstractRestricted branching programs are considered in complexity theory in order to study the spac...
We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching...
AbstractBranching programs (b.p.'s) or decision diagrams are a general graph-based model of sequenti...
AbstractWe construct Boolean functions (computable by polynomial-size circuits) with large lower bou...
AbstractBranching programs are a well-established computation model for Boolean functions, especiall...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
Branching programs are a general model of sequential computation. One of their computational feature...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
AbstractBy (1, + k(n))-branching programs (b.p.'s) we mean those b.p.'s which during each of their c...
AbstractInput oblivious decision graphs of linear length are considered. Among other concerns the co...
AbstractWe prove the first lower bounds for restricted read-once parity branching programs with unli...
AbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching pro...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
AbstractWe present a new method for proving lower bounds on the complexity of branching programs and...
AbstractRestricted branching programs are considered in complexity theory in order to study the spac...
We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching...
AbstractBranching programs (b.p.'s) or decision diagrams are a general graph-based model of sequenti...
AbstractWe construct Boolean functions (computable by polynomial-size circuits) with large lower bou...
AbstractBranching programs are a well-established computation model for Boolean functions, especiall...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
Branching programs are a general model of sequential computation. One of their computational feature...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
AbstractBy (1, + k(n))-branching programs (b.p.'s) we mean those b.p.'s which during each of their c...
AbstractInput oblivious decision graphs of linear length are considered. Among other concerns the co...
AbstractWe prove the first lower bounds for restricted read-once parity branching programs with unli...
DOI
Add to ORKG