Results 1  10
of
212,513
nondeterministic graphdriven readonce
"... A very simple function that requires exponential size ..."
On Nondeterminism versus Randomness for ReadOnce Branching Programs
 Electronic Colloquium on Computational Complexity
, 1997
"... Randomized branching programs are a probabilistic model of computation defined in analogy to the wellknown probabilistic Turing machines. In this paper, we present complexity theoretic results for randomized readonce branching programs. Our main result shows that nondeterminism can be more powerfu ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
powerful than randomness for readonce branching programs. We present a function which is computable by nondeterministic readonce branching programs of polynomial size, while on the other hand randomized readonce branching programs for this function with twosided error at most 21 OE 256 have
Lower Bounds for the Sum of Graph–driven Read–Once Parity Branching Programs
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 68
, 2003
"... We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a challengin ..."
Abstract
 Add to MetaCart
We prove the first lower bound for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is still a
Quantum vs. classical readonce branching programs
, 504
"... Abstract. The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum readonce branching programs. It is shown that the computational power of quantum and classical readonce branching programs is incomparable in the following strict sense: (i) A simple, explicit boole ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum readonce branching programs. It is shown that the computational power of quantum and classical readonce branching programs is incomparable in the following strict sense: (i) A simple, explicit
Lower Bounds for Restricted Read–Once Parity Branching Programs
, 2004
"... We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open ..."
Abstract
 Add to MetaCart
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open
No small nondeterministic readonce branching programs for CNFs of bounded treewidth
"... Abstract. In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primary graphs such that the equivalent nondeterministic readonce branching programs (NROBPs) are of size at least nck for some universal constant c. Thus we rule out the possibil ..."
Abstract
 Add to MetaCart
Abstract. In this paper, given a parameter k, we demonstrate an infinite class of CNFs of treewidth at most k of their primary graphs such that the equivalent nondeterministic readonce branching programs (NROBPs) are of size at least nck for some universal constant c. Thus we rule out
On the Size of Randomized OBDDs and ReadOnce Branching Programs for kStable Functions
 In Proc. of the 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS), LNCS 1563
, 1999
"... In this paper, a simple technique which unifies the known approaches for proving lower bound results on the size of deterministic, nondeterministic, and randomized OBDDs and kOBDDs is described. ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
In this paper, a simple technique which unifies the known approaches for proving lower bound results on the size of deterministic, nondeterministic, and randomized OBDDs and kOBDDs is described.
A Lower Bound for Integer Multiplication on Randomized ReadOnce Branching Programs
, 1998
"... We prove an exponential lower bound (2\Omega\Gamma n= log n) ) on the size of any randomized ordered readonce branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized oneway communication complexity of certain boolean functions. ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
We prove an exponential lower bound (2\Omega\Gamma n= log n) ) on the size of any randomized ordered readonce branching program computing integer multiplication. Our proof depends on proving a new lower bound on Yao's randomized oneway communication complexity of certain boolean functions
The STATEMATE Semantics of Statecharts
, 1996
"... This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since b ..."
Abstract

Cited by 651 (12 self)
 Add to MetaCart
This article describes the semantics of the language of statecharts as implenented in the STATEMATE system [Harel et al. 1990; Harel and Politi 1996]. The initial version of this semantics was developed by a team about.10 years ago. With the added experience of the users of the system it has since
Results 1  10
of
212,513