<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2025-26-3-58-70</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-2005</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Article</subject></subj-group></article-categories><title-group><article-title>О порядке гладкости максимального выпуклого продолжения булевой функции</article-title><trans-title-group xml:lang="en"><trans-title>On the order of smoothness of the maximal convex continuation of a Boolean function</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Баротов</surname><given-names>Достонжон Нумонжонович</given-names></name><name name-style="western" xml:lang="en"><surname>Barotov</surname><given-names>Dostonjon Numonjonovich</given-names></name></name-alternatives><email xlink:type="simple">DNBarotov@fa.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Баротов</surname><given-names>Рузибой Нумонжонович</given-names></name><name name-style="western" xml:lang="en"><surname>Barotov</surname><given-names>Ruziboy Numonjonovich</given-names></name></name-alternatives><email xlink:type="simple">ruzmet.tj@mail.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Финансовый университет при Правительстве Российской Федерации</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Financial University under the Government of the Russian Federation</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Худжандский государственный университет имени академика Б. Гафурова</institution><country>Таджикистан</country></aff><aff xml:lang="en"><institution>Khujand state university named after academician Bobojon Gafurov</institution><country>Tajikistan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>01</day><month>11</month><year>2025</year></pub-date><volume>26</volume><issue>3</issue><fpage>58</fpage><lpage>70</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Баротов Д.Н., Баротов Р.Н., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Баротов Д.Н., Баротов Р.Н.</copyright-holder><copyright-holder xml:lang="en">Barotov D.N., Barotov R.N.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.chebsbornik.ru/jour/article/view/2005">https://www.chebsbornik.ru/jour/article/view/2005</self-uri><abstract><p>Данная статья посвящена установлению порядка гладкости 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) — наибольшего выпуклого продолжения на [0, 1]𝑛 любой булевой функции 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛). В результате исследования для каждой булевой функции 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛) установлен порядокдифференцируемости 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) — соответствующего ей наибольшего выпуклого продолжения на [0, 1]𝑛, а именно, во-первых, с обеих сторон оценено наибольшее выпуклое продолжение 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) так, что из чего следует непрерывность 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) на [0, 1]𝑛 для любого натурального 𝑛, а во-вторых, доказано, что если число существенных переменных булевой функции 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛) меньше двух, то на [0, 1]𝑛 наибольшее выпуклое продолжение 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) бесконечно дифференцируемо, а если не мень-ше двух, то на [0, 1]𝑛 наибольшее выпуклое продолжение 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) не является дифференцируемым, т. е. является лишь непрерывным.</p></abstract><trans-abstract xml:lang="en"><p>This paper is devoted to establishing the order of smoothness of 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) — the largest convex continuation to [0, 1]𝑛 of any Boolean function 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛). As a result of the study, for each Boolean function 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛), the order of differentiability of 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) — the corresponding greatest convex continuation to [0, 1]𝑛 — was established, namely, firstly, the greatest convex continuation 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) was estimated from both sides so that, which implies the continuity of 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) on [0, 1]𝑛 for anynatural 𝑛, and secondly, it was proved that if the number of essential variables of the Boolean function 𝑓𝐵(𝑥1, 𝑥2, ..., 𝑥𝑛) is less than two, then on [0, 1]𝑛 the greatest convex continuation 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) is infinite differentiable, and if there are at least two, then on [0, 1]𝑛 the largest convex continuation 𝑓𝑁𝑅(𝑥1, 𝑥2, ..., 𝑥𝑛) is not differentiable, i.e. it is only continuous.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>выпуклое продолжение булевой функции</kwd><kwd>булева функция</kwd><kwd>выпуклая функция</kwd><kwd>глобальная оптимизация</kwd><kwd>локальный экстремум.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>convex continuation of a Boolean function</kwd><kwd>Boolean function</kwd><kwd>convex function</kwd><kwd>global optimization</kwd><kwd>local extremum.</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Brown F. M. Boolean Reasoning: The logic of Boolean Equations. Kluwer Academic Publishers, Boston, 1990.</mixed-citation><mixed-citation xml:lang="en">Brown, F.M. 1990, Boolean Reasoning: The logic of Boolean Equations, Boston: Kluwer Academic Publishers.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н., Баротов, Р. Н. Об одном приведении системы булевых уравнений к эквивалентной системе полиномиальных уравнений // Математические структуры и моделирование. 2024. № 1(69). С. 5–17. doi: 10.24147/2222-8772.2024.1.5-17.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. &amp; Barotov, R.N. 2024, “On a reduction of the system of Boolean equations to an equivalent system of polynomial equations”, Mathematical Structures and Modeling, no. 1(69), pp. 5–17. doi: 10.24147/2222-8772.2024.1.5-17.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hammer, P. L., Rudeanu, S. Boolean Methods in Operations Research and Related Areas. Springer Verlag, Berlin, 1968.</mixed-citation><mixed-citation xml:lang="en">Hammer, P.L. &amp; Rudeanu, S. 1968, Boolean Methods in Operations Research and Related Areas, Berlin: Springer Verlag.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н., Баротов, Р. Н. Конструирование гладких выпуклых продолжений булевых функций // Вестник российских университетов. Математика. 2024. Т. 29. № 145. С. 20—28. doi:10.20310/2686-9667-2024-29-145-20-28.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. &amp; Barotov, R.N. 2024, “Construction of smooth convex extensions of Boolean functions”, Russian Universities Reports. Mathematics, vol. 29, no. 145, pp. 20–28. doi:10.20310/2686-9667-2024-29-145-20-28.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Bard, G. V. Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis. University of Maryland, College Park, 2007.</mixed-citation><mixed-citation xml:lang="en">Bard, G.V. 2007, Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis, College Park: University of Maryland.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Faugere, J. C., Joux, A. Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Grobner bases // Annual International Cryptology Conference. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. P. 44–60.</mixed-citation><mixed-citation xml:lang="en">Faugere, J.C. &amp; Joux, A. 2003, “Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Grobner bases”, in Annual International Cryptology Conference, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 44–60.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Armknecht, F. Improving fast algebraic attacks // Fast Software Encryption: 11th International Workshop, FSE 2004, Delhi, India, February 5-7, 2004. Revised Papers 11. Springer Berlin Heidelberg, 2004. P. 65–82.</mixed-citation><mixed-citation xml:lang="en">Armknecht, F. 2004, “Improving fast algebraic attacks”, in Fast Software Encryption: 11-th International Workshop, FSE 2004, Delhi, India, February 5-7, 2004. Revised Papers 11, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 65–82.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Bardet, M., Faugere, J. C., Salvye, B., Spaenlehauer, P. J. On the complexity of solving quadratic Boolean systems // Journal of Complexity. 2013. Vol. 29. no. 1. P. 53–75. doi: 10.1016/j.jco.2012.07.001.</mixed-citation><mixed-citation xml:lang="en">Bardet, M., Faugere, J.C., Salvye, B. &amp; Spaenlehauer, P.J. 2013, “On the complexity of solving quadratic Boolean systems”, Journal of Complexity, vol. 29, no. 1, pp. 53–75. doi:10.1016/j.jco.2012.07.001.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Courtois, N. T. Fast algebraic attacks on stream ciphers with linear feedback // Advances in Cryptology-CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings 23. Springer Berlin Heidelberg, 2003. P. 176–194.</mixed-citation><mixed-citation xml:lang="en">Courtois, N.T. 2003, “Fast algebraic attacks on stream ciphers with linear feedback”, in Advances in Cryptology-CRYPTO 2003: 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003. Proceedings 23, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 176–194.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Liu, M., Lin, D., Pei, D. Fast algebraic attacks and decomposition of symmetric Boolean functions // IEEE Transactions on Information Theory. 2011. Vol. 57. no. 7. P. 4817–4821. doi: 10.1109/TIT.2011.2145690.</mixed-citation><mixed-citation xml:lang="en">Liu, M., Lin, D. &amp; Pei, D. 2011, “Fast algebraic attacks and decomposition of symmetric Boolean functions”, IEEE Transactions on Information Theory, vol. 57, no. 7, pp. 4817–4821. doi:10.1109/TIT.2011.2145690.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Gu, J. How to Solve Very Large-Scale Satisfiability (VLSS) Problems // Technical Report UCECETR-90-002, University of Calgary: Calgary, 1990.</mixed-citation><mixed-citation xml:lang="en">Gu, J. 1990, “How to Solve Very Large-Scale Satisfiability (VLSS) Problems”, Technical Report UCECETR-90-002, University of Calgary, Calgary.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Gu, J. On optimizing a search problem // Artificial Intelligence Methods and Applications. 1992. P. 63–105. doi: 10.1142/9789814354707_0002.</mixed-citation><mixed-citation xml:lang="en">Gu, J. 1992, “On optimizing a search problem”, Artificial Intelligence Methods and Applications, pp. 63–105. doi:10.1142/9789814354707_0002.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н., Музафаров, Д. З., Баротов, Р. Н. Об одном методе решения систем булевых алгебраических уравнений // Современная математика и концепции инновационного математического образования. 2021. Т. 8, № 1. С. 17—23.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N., Muzafarov, D.Z. &amp; Barotov, R.N. 2021, “On one method for solving systems of Boolean algebraic equations”, Mod. Math. Concept Innov. Math. Educ., vol. 8, pp. 17–23.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Gu, J. Global optimization for satisfiability (SAT) problem // IEEE Transactions on Knowledge and Data Engineering. 1994. Vol. 6. no. 3. P. 361–381. doi: 10.1109/69.334864.</mixed-citation><mixed-citation xml:lang="en">Gu, J. 1994, “Global optimization for satisfiability (SAT) problem”, IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 3, pp. 361–381. doi:10.1109/69.334864.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Gu, J., Gu, Q., Du, D. On optimizing the satisfiability (SAT) problem // Journal of Computer Science and Technology. 1999. Vol. 14. no. 1. P. 1–17. doi: 10.1007/BF02952482.</mixed-citation><mixed-citation xml:lang="en">Gu, J., Gu, Q. &amp; Du, D. 1999, “On optimizing the satisfiability (SAT) problem”, Journal of Computer Science and Technology, vol. 14, no. 1, pp. 1–17. doi:10.1007/BF02952482.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Transformation method for solving system of Boolean algebraic equations / Barotov, D., Osipov, A., Korchagin, S., Pleshakova, E., Muzafarov, D., Barotov, R., Serdechnyy, D. // Mathematics. 2021. Vol. 9, 3299. doi: 10.3390/math9243299.</mixed-citation><mixed-citation xml:lang="en">Barotov, D., Osipov, A., Korchagin, S., Pleshakova, E., Muzafarov, D., Barotov, R. &amp; Serdechnyy, D. 2021, “Transformation method for solving system of Boolean algebraic equations”, Mathematics, vol. 9, p. 3299. doi:10.3390/math9243299.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis / Pakhomchik, A. I., Voloshinov, V. V., Vinokur, V. M., Lesovik, G. B. // Algorithms. 2022. Vol. 15, 33. doi: 10.3390/a15020033.</mixed-citation><mixed-citation xml:lang="en">Pakhomchik, A.I., Voloshinov, V.V., Vinokur, V.M. &amp; Lesovik, G.B. 2022, “Converting of Boolean Expression to Linear Equations, Inequalities and QUBO Penalties for Cryptanalysis”, Algorithms, vol. 15, p. 33. doi:10.3390/a15020033.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Algebraic attacks on block ciphers using quantum annealing / Burek, E., Wronski, M., Mank, K., Misztal, M. // IEEE Transactions on Emerging Topics in Computing. 2022. Vol. 10. no. 2. P. 678—689. doi: 10.1109/TETC.2022.3143152.</mixed-citation><mixed-citation xml:lang="en">Burek, E., Wronski, M., Mank, K. &amp; Misztal, M. 2022, “Algebraic attacks on block ciphers using quantum annealing”, IEEE Transactions on Emerging Topics in Computing, vol. 10, no. 2, pp. 678–689. doi:10.1109/TETC.2022.3143152.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Abdel-Gawad, A. H., Atiya, A. F., Darwish, N. M. Solution of systems of Boolean equations via the integer domain // Information Sciences. 2010. Vol. 180, no. 2, P. 288–300. doi: 10.1016/j.ins.2009.09.010.</mixed-citation><mixed-citation xml:lang="en">Abdel-Gawad, A.H., Atiya, A.F. &amp; Darwish, N.M. 2010, “Solution of systems of Boolean equations via the integer domain”, Information Sciences, vol. 180, no. 2, pp. 288–300. doi:10.1016/j.ins.2009.09.010.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">The Development of Suitable Inequalities and Their Application to Systems of Logical Equations / Barotov, D. N., Barotov, R. N., Soloviev, V., Feklin, V., Muzafarov, D., Ergashboev, T., Egamov, K. // Mathematics. 2022. Vol. 10, 1851. doi: 10.3390/math10111851.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N., Barotov, R.N., Soloviev, V., Feklin, V., Muzafarov, D., Ergashboev, T. &amp; Egamov, K. 2022, “The Development of Suitable Inequalities and Their Application to Systems of Logical Equations”, Mathematics, vol. 10, p. 1851. doi:10.3390/math10111851.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Faugere, J. C. A new efficient algorithm for computing Grobner bases (F4) // Journal of pure and applied algebra. 1999. Vol. 139. no. 1-3. P. 61–88. doi: 10.1016/S0022-4049(99)00005-5.</mixed-citation><mixed-citation xml:lang="en">Faugere, J.C. 1999, “A new efficient algorithm for computing Grobner bases (F4)”, Journal of Pure and Applied Algebra, vol. 139, no. 1-3, pp. 61–88. doi:10.1016/S0022-4049(99)00005-5.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Faugere, J. C. A new efficient algorithm for computing Grobner bases without reduction to zero (F5) // Proceedings of the 2002 international symposium on Symbolic and algebraic computation. 2002. P. 75–83.</mixed-citation><mixed-citation xml:lang="en">Faugere, J.C. 2002, “A new efficient algorithm for computing Grobner bases without reduction to zero (F5)”, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75–83.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Файзуллин, Р.Т., Дулькейт, В. И., Огородников, Ю.Ю. Гибридный метод поиска приближенного решения задачи 3-выполнимость, ассоциированной с задачей факторизации // Труды Института математики и механики УрО РАН. 2013. Т. 19, № . 2. С. 285–294.</mixed-citation><mixed-citation xml:lang="en">Faizullin, R.T., Dul’keit, V.I. &amp; Ogorodnikov, Yu.Yu. 2013, “A hybrid search method for the approximate solution of the 3-satisfiability problem associated with the factorization problem”, Trudy Instituta Matematiki i Mekhaniki, vol. 19, no. 2, pp. 285–294.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н., Баротов, Р. Н. Полилинейные продолжения некоторых дискретных функций и алгоритм их нахождения // Вычислительные методы и программирование. 2023. Т. 24. С. 10–23. doi: 10.26089/NumMet.v24r102.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. &amp; Barotov, R.N. 2023, “Polylinear continuations of some discrete functions and an algorithm for finding them”, Numerical Methods and Programming (Vychislitel’nye Metody i Programmirovanie), vol. 24, pp. 10–23. doi:10.26089/NumMet.v24r102.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Barotov, D. N. Target Function without Local Minimum for Systems of Logical Equations with a Unique Solution // Mathematics. 2022. Vol. 10, 2097. doi: 10.3390/math10122097.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. 2022, “Target Function without Local Minimum for Systems of Logical Equations with a Unique Solution”, Mathematics, vol. 10, p. 2097. doi:10.3390/math10122097.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Barotov, D. N., Barotov, R. N. Polylinear Transformation Method for Solving Systems of Logical Equations // Mathematics. 2022. Vol. 10, 918. doi: 10.3390/math10060918.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. &amp; Barotov, R.N. 2022, “Polylinear Transformation Method for Solving Systems of Logical Equations”, Mathematics, vol. 10, p. 918. doi:10.3390/math10060918.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н. Выпуклое продолжение булевой функции и его приложения // Дискретный анализ и исследование операций. 2024. Т. 31, № 1. С. 5–18. doi: 10.33048/daio.2024.31.779.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. 2024, “Convex Continuation of a Boolean Function and Its Applications”, Journal of Applied and Industrial Mathematics, vol. 18, pp. 1–9. doi:10.1134/S1990478924010010.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н. О существовании и свойствах выпуклых продолжений булевых функций // Матем. заметки. 2024. Т. 115, № 4. С. 533—551. doi: 10.4213/mzm14105.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. 2024, “On the Existence and Properties of Convex Extensions of Boolean Functions”, Mathematical Notes, vol. 115, no. 4, pp. 489–505. doi:10.1134/S0001434624030210.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н., Судаков, В. А. О неравенствах между выпуклыми, вогнутыми и полилинейными продолжениями булевых функций // Препринты ИПМ им. М.В. Келдыша. 2024. № 30. С. 1–13. doi: 10.20948/prepr-2024-30.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. &amp; Sudakov, V.A. 2024, “On inequalities between convex, concave, and polylinear continuations of Boolean functions”, Preprints of the M.V. Keldysh Institute of Applied Mathematics, no. 30, pp. 1–13. doi:10.20948/prepr-2024-30.</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н. Вогнутые продолжения булевых функций и некоторые их свойства и приложения // Известия Иркутского государственного университета. Серия ≪Математика≫. 2024. Т. 49. С. 105–123. doi: 10.26516/1997-7670.2024.49.105.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. 2024, “Concave Continuations of Boolean Functions and Some of Their Properties and Applications”, The Bulletin of Irkutsk State University. Series Mathematics, vol. 49, pp. 105–123. (in Russian). doi:10.26516/1997-7670.2024.49.105.</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Баротов, Д. Н. Выпуклые продолжения некоторых дискретных функций // Дискретный анализ и исследование операций. 2024. Т. 31, № 3. С. 5–23. doi: 10.33048/daio.2024.31.789.</mixed-citation><mixed-citation xml:lang="en">Barotov, D.N. 2024, “Convex Continuations of Some Discrete Functions”, Journal of Applied and Industrial Mathematics, vol. 18, no. 3, pp. 412–423. doi:10.1134/S1990478924030049.</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">Jensen, J. L. W. V. Sur les fonctions convexes et les inegalites entre les valeurs moyennes // Acta mathematica. 1906. Vol. 30. no. 1. P. 175–193. doi: 10.1007/BF02418571.</mixed-citation><mixed-citation xml:lang="en">Jensen, J.L.W.V. 1906, “Sur les fonctions convexes et les in´egalit´es entre les valeurs moyennes”, Acta Mathematica, vol. 30, no. 1, pp. 175–193. doi:10.1007/BF02418571.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
