Add to ORKGWe propose a new descriptive complexity notion of uniformity for branching programs solving problems defined on structured data. We observe that FO[=]-uniform (n-way) branching programs are unable to solve the tree evaluation problem studied by Cook, McKenzie, Wehr, Braverman and Santhanam [8] because such programs possess a variant of their thriftiness property. Similarly, FO[=]-uniform (n-way) branching programs are unable to solve the P-complete GEN problem because such programs possess the incremental property studied by Gál, Kouck´y and McKenzie [10]. 1
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
Abstract We propose an information-theoretic approach to proving lower bounds on the size of branchi...
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs i...
In this paper, we show that while almost all functions require exponential size branching programs t...
AbstractWe propose an information-theoretic approach to proving lower bounds on the size of branchin...
We study under what circumstances different uniformity notions for Boolean circuits of logarithmic d...
We study under what circumstances different uniformity notions for Boolean circuits of logarithmic d...
AbstractIn order to study circuit complexity classes within NC1 in a uniform setting, we need a unif...
. We define the notion of a randomized branching program in the natural way similar to the definitio...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
Non-uniform complexity measures originated in automata and formal languages theory are characterized...
We propose a new model of restricted branching programs which we call {em incremental branching prog...
We propose a new model of restricted branching programs which we call incremental branching programs...
AbstractBranching program depth and the logarithm of branching program complexity are lower bounds o...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
Abstract We propose an information-theoretic approach to proving lower bounds on the size of branchi...
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs i...
In this paper, we show that while almost all functions require exponential size branching programs t...
AbstractWe propose an information-theoretic approach to proving lower bounds on the size of branchin...
We study under what circumstances different uniformity notions for Boolean circuits of logarithmic d...
We study under what circumstances different uniformity notions for Boolean circuits of logarithmic d...
AbstractIn order to study circuit complexity classes within NC1 in a uniform setting, we need a unif...
. We define the notion of a randomized branching program in the natural way similar to the definitio...
AbstractIn unrestricted branching programs all variables may be tested arbitrarily often on each pat...
Non-uniform complexity measures originated in automata and formal languages theory are characterized...
We propose a new model of restricted branching programs which we call {em incremental branching prog...
We propose a new model of restricted branching programs which we call incremental branching programs...
AbstractBranching program depth and the logarithm of branching program complexity are lower bounds o...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
Abstract We propose an information-theoretic approach to proving lower bounds on the size of branchi...
We show that the satisfiability problem for bounded-error probabilistic ordered branching programs i...