AbstractThe power of probabilistic linear decision trees is examined. It is shown that the standard arguments used to prove lower bounds on deterministic linear decision trees apply to probabilistic linear decision trees as well. Examples are next given of problems which randomization helps solving
The best current methods for exactly com-puting the number of satisfying assignments, or the satisfy...
We adopt probabilistic decision graphs developed in the field of automated verification as a tool fo...
We present a new method for deriving lower bounds to the expected number of queries made by noisy de...
AbstractThe power of probabilistic linear decision trees is examined. It is shown that the standard ...
AbstractAssume we want to show that (a) the cost of any randomized decision tree computing a given B...
We introduce a new powerful method for proving lower bounds on randomized and deterministic analyti...
Assume we want to show that (a) the cost of any randomized decision tree computing a given Boolean f...
AbstractA probabilistic algebraic computation tree (probabilistic ACT) which recognizes L ⊂ Rn in ex...
AbstractWe consider the role of randomness for the decisional complexity in algebraic decision (or c...
A classic result of Nisan [SICOMP '91] states that the deterministic decision tree∗depth∗complexity ...
Udgivelsesdato: JANWe adopt probabilistic decision graphs developed in the field of automated verifi...
The best current methods for exactly com-puting the number of satisfying assignments, or the satisfy...
We prove the first nontrivial (and superlinear) lower bounds on the depth of randomized algebraic de...
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a...
AbstractIt is well known that probabilistic boolean decision trees cannot be much more powerful than...
The best current methods for exactly com-puting the number of satisfying assignments, or the satisfy...
We adopt probabilistic decision graphs developed in the field of automated verification as a tool fo...
We present a new method for deriving lower bounds to the expected number of queries made by noisy de...
AbstractThe power of probabilistic linear decision trees is examined. It is shown that the standard ...
AbstractAssume we want to show that (a) the cost of any randomized decision tree computing a given B...
We introduce a new powerful method for proving lower bounds on randomized and deterministic analyti...
Assume we want to show that (a) the cost of any randomized decision tree computing a given Boolean f...
AbstractA probabilistic algebraic computation tree (probabilistic ACT) which recognizes L ⊂ Rn in ex...
AbstractWe consider the role of randomness for the decisional complexity in algebraic decision (or c...
A classic result of Nisan [SICOMP '91] states that the deterministic decision tree∗depth∗complexity ...
Udgivelsesdato: JANWe adopt probabilistic decision graphs developed in the field of automated verifi...
The best current methods for exactly com-puting the number of satisfying assignments, or the satisfy...
We prove the first nontrivial (and superlinear) lower bounds on the depth of randomized algebraic de...
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a...
AbstractIt is well known that probabilistic boolean decision trees cannot be much more powerful than...
The best current methods for exactly com-puting the number of satisfying assignments, or the satisfy...
We adopt probabilistic decision graphs developed in the field of automated verification as a tool fo...
We present a new method for deriving lower bounds to the expected number of queries made by noisy de...
DOI
Add to ORKG