Evaluation of Monotone DNF Formulas

Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt

    Research output: Contribution to journalArticlepeer-review

    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 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.

    Original languageEnglish (US)
    Pages (from-to)661-685
    Number of pages25
    JournalAlgorithmica
    Volume77
    Issue number3
    DOIs
    StatePublished - Mar 1 2017

    Keywords

    • Approximation algorithms
    • DNF formulas
    • Sequential testing
    • Stochastic boolean function evaluation

    ASJC Scopus subject areas

    • Computer Science(all)
    • Computer Science Applications
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Evaluation of Monotone DNF Formulas'. Together they form a unique fingerprint.

    Cite this