Kochergin, V. V., & Mihajlovich, A. V. (2024). On the non-monotone complexity of Boolean and k-value logic functions. Mathematical Problems of Cybernetics, 51. https://doi.org/10.20948/mvk-2024-51
Chicago Style (17th ed.) CitationKochergin, Vadim Vasilievich, and Anna Vitalievna Mihajlovich. "On the Non-monotone Complexity of Boolean and K-value Logic Functions." Mathematical Problems of Cybernetics 2024: 51. https://doi.org/10.20948/mvk-2024-51.
MLA (9th ed.) CitationKochergin, Vadim Vasilievich, and Anna Vitalievna Mihajlovich. "On the Non-monotone Complexity of Boolean and K-value Logic Functions." Mathematical Problems of Cybernetics, 2024, p. 51, https://doi.org/10.20948/mvk-2024-51.
Warning: These citations may not always be 100% accurate.