Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. J. Acharya, A. Jafarpour, A. Orlitsky, Expected query complexity of symmetric Boolean functions, in: IEEE 49th Annual Allerton Conference on Communication, Control, and Computing, 2011, pp. 26–29.
2. Evaluation of monotone DNF formulas;Allen;Algorithmica,2017
3. Submodular goal value of Boolean functions;Bach;Discrete Appl. Math.,2018
4. Optimal testing procedures for special structures of coherent systems;Ben-Dov;Manage. Sci.,1981
5. Diagnosing double regular systems;Boros;Ann. Math. Artif. Intell.,1999
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献