Name
Abstract | ||
|---|---|---|
Stochastic Boolean Function Evaluation (SBFE) is the problem of determining the value of a given Boolean function $f$ on an unknown input $x$, when each bit of $x_i$ of $x$ can only be determined by paying a given associated cost $c_i$. Further, $x$ is drawn from a given product distribution: for each $x_i$, $Prob[x_i=1] = p_i$, and the bits are independent. The goal is to minimize the expected cost of evaluation. Stochastic Boolean Function Evaluation (SBFE) is the problem of determining the value of a given Boolean function $f$ on an unknown input $x$, when each bit of $x_i$ of $x$ can only be determined by paying a given associated cost $c_i$. Further, $x$ is drawn from a given product distribution: for each $x_i$, $Prob[x_i=1] = p_i$, and the bits are independent. The goal is to minimize the expected cost of evaluation. In this paper, we study the complexity of the SBFE problem for classes of DNF formulas. We consider both exact and approximate versions of the problem for subclasses of DNF, for arbitrary costs and product distributions, and for unit costs and/or the uniform distribution. |
Year | Venue | DocType |
|---|---|---|
2013 | ISAIM | Journal |
Volume | Citations | PageRank |
abs/1310.3673 | 4 | 0.40 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sarah R. Allen | 1 | 22 | 2.43 |
| Lisa Hellerstein | 2 | 710 | 121.90 |
| Devorah Kletenik | 3 | 30 | 6.77 |
| Tonguç Ünlüyurt | 4 | 102 | 8.94 |