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.

[thumbnail of 2017_Algorithmica_Allen_Hellerstein_Kletenik_Unluyurt.pdf] PDF
Restricted to Registered users only

Download (593kB) | Request a copy


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
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences
Depositing User: Tonguç Ünlüyurt
Date Deposited: 20 Aug 2017 11:48
Last Modified: 26 Apr 2022 09:45
URI: https://research.sabanciuniv.edu/id/eprint/32460

Available Versions of this Item

Actions (login required)

View Item
View Item