Evaluation of monotone DNF formulas

Allen, Sarah R. and Hellerstein, Lisa and Kletenik, Devorah and Ünlüyurt, Tonguç (2017) Evaluation of monotone DNF formulas. Algorithmica, 77 (3). pp. 661-685. ISSN 0178-4617 (Print) 1432-0541 (Online)

This is the latest version of this item.

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1007/s00453-015-0092-9


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 xi of x can only be determined by paying a given associated cost ci. Further, x is drawn from a given product distribution: for each xi, 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.

Item Type:Article
Uncontrolled Keywords:DNF formulas; Sequential testing; Stochastic boolean function evaluation; Approximation algorithms
ID Code:32460
Deposited By:Tonguç Ünlüyurt
Deposited On:20 Aug 2017 11:48
Last Modified:22 May 2019 13:52

Available Versions of this Item

Repository Staff Only: item control page