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
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
We present very sharp separation results for Turing machine sublogarithmic space complexity classes ...
AbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching pro...
We obtain an exponential separation between consecutive levels in the hierarchy of classes of functi...
AbstractWe first consider the so-called (1, +s)-branching programs in which along every consistent p...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds o...
) Martin Sauerhoff ? Fachbereich Informatik, Universitat Dortmund, 44221 Dortmund, Germany e-Mai...
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own ...
Cai and Furst introduced the notion of bottleneck Turing machines and showed that the languages reco...
AbstractIn the following new types of branching programs, so-called Ω-branching programs, Ω ⊆ B2, ar...
AbstractWe present a new method for proving lower bounds on the complexity of branching programs and...
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
We present very sharp separation results for Turing machine sublogarithmic space complexity classes ...
AbstractBy means of exponential lower and polynomial upper bounds for read-once-only Ω-branching pro...
We obtain an exponential separation between consecutive levels in the hierarchy of classes of functi...
AbstractWe first consider the so-called (1, +s)-branching programs in which along every consistent p...
AbstractWe give a Cn lower bound for read-once-only branching programs computing an explicit Boolean...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
We characterize in terms of oracle Turing machines the classes defined by exponential lower bounds o...
) Martin Sauerhoff ? Fachbereich Informatik, Universitat Dortmund, 44221 Dortmund, Germany e-Mai...
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own ...
Cai and Furst introduced the notion of bottleneck Turing machines and showed that the languages reco...
AbstractIn the following new types of branching programs, so-called Ω-branching programs, Ω ⊆ B2, ar...
AbstractWe present a new method for proving lower bounds on the complexity of branching programs and...
A longstanding open problem in complexity theory is whether the class Polytime (P) is the same as Lo...
AbstractEach (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivio...
AbstractNondeterministic branching programs introduced by Meinel (1986) proved to be an interesting ...
We present very sharp separation results for Turing machine sublogarithmic space complexity classes ...
DOI
Add to ORKG