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 $$x_i$$xi of x can only be determined by paying a given associated cost $$c_i$$ci. Further, x is drawn from a given product distribution: for each $$x_i$$xi, $$\mathbf{Pr}[x_i=1] = p_i$$Pr[xi=1]=pi 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
