The stochastic Boolean function evaluation problem for symmetric Boolean functions
From MaRDI portal
Publication:2065798
DOI10.1016/J.DAM.2021.12.001OpenAlexW3211688262MaRDI QIDQ2065798FDOQ2065798
Authors: Dimitrios Gkenosis, Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik 
Publication date: 13 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.08793
Recommendations
- Evaluation of monotone DNF formulas
- Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Submodular goal value of Boolean functions
Cites Work
- Sequential testing of complex systems: a review
- Diagnosing double regular systems
- Optimal Testing Procedures for Special Structures of Coherent Systems
- An optimum testing algorithm for some symmetric coherent systems
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- Evaluation of monotone DNF formulas
- Minimum latency submodular cover
- Revisiting the approximation bound for stochastic submodular cover
- Submodular goal value of Boolean functions
- Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- A Tight Bound for Stochastic Submodular Cover
- Title not available (Why is that?)
Cited In (5)
- Simple algorithms for stochastic score classification with small approximation ratios
- Title not available (Why is that?)
- A New Algorithm for Complex Stochastic Boolean Systems
- Some problems of spectral analysis of random Boolean functions with constraints
- Algorithms for the unit-cost stochastic score classification problem
This page was built for publication: The stochastic Boolean function evaluation problem for symmetric Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065798)
