1. AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol. 146. Springer (2019)
2. Azad, M., Chikalov, I., Hussain, S., Moshkov, M.: Sorting by decision trees with hypotheses (extended abstract). In: Schlingloff, H., Vogel, T. (eds.) 29th International Workshop on Concurrency, Specification and Programming, CS &P 2021, Berlin, Germany, 27–28 Sept 2021. CEUR Workshop Proceedings, vol. 2951, pp. 126–130. CEUR-WS.org (2021). http://ceur-ws.org/Vol-2951/paper1.pdf
3. Azad, M., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Decision trees with hypotheses for recognition of monotone Boolean functions and for sorting. arXiv:2203.08894 [cs.CC] (2022). https://doi.org/10.48550/arXiv.2203.08894
4. Church, R.: Numerical analysis of certain free distributive structures. Duke Math. J. 6(3), 732–734 (1940)
5. Hansel, G.: Sur le nombre des fonctions booléennes monotones de $$n$$ variables. C. R. Acad. Sci. Paris 262(20), 1088–1090 (1966)