AbstractAs an application of the inductive counting technique to a circuit-like model, we prove that complementation on nondeterministic branching programs can be done without increasing the width excessively. A consequence of this result is that the class of languages recognized by a generalization of nonuniform finite automata to nonconstant space is closed under complement
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width ...
As an application of the inductive counting technique to a circuit-like model, we prove that complem...
AbstractAs an application of the inductive counting technique to a circuit-like model, we prove that...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
AbstractImmerman and Szelepcsényi′s inductive counting technique demonstrated that, for space classe...
We propose a new model of restricted branching programs which we call incremental branching programs...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
We propose a new model of restricted branching programs which we call incremental branching programs...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width ...
As an application of the inductive counting technique to a circuit-like model, we prove that complem...
AbstractAs an application of the inductive counting technique to a circuit-like model, we prove that...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
AbstractImmerman and Szelepcsényi′s inductive counting technique demonstrated that, for space classe...
We propose a new model of restricted branching programs which we call incremental branching programs...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
We propose a new model of restricted branching programs which we call incremental branching programs...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
AbstractWe use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width ...
DOI
Add to ORKG