American Psychological Association 6th edition

Chashkin, A. V. (2025). On the Complexity of One System of Linear Boolean Functions. Moscow University Mathematics Bulletin, 80(2), 133-135. https://doi.org/10.3103/s0027132225700329

ISO-690 (author-date, English)

CHASHKIN, A. V., 2025. On the Complexity of One System of Linear Boolean Functions. Moscow University Mathematics Bulletin. 1 April 2025. Vol. 80, no. 2, p. 133-135. DOI 10.3103/s0027132225700329.

Modern Language Association 9th edition

Chashkin, A. V. „On the Complexity of One System of Linear Boolean Functions“. Moscow University Mathematics Bulletin, Bd. 80, Nr. 2, April 2025, S. 133-5, https://doi.org/10.3103/s0027132225700329.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chashkin, A. V.: On the Complexity of One System of Linear Boolean Functions, Moscow University Mathematics Bulletin 2025, 133-135.

Emerald - Harvard

Chashkin, A.V. (2025), „On the Complexity of One System of Linear Boolean Functions“, Moscow University Mathematics Bulletin, Vol. 80 No. 2, S. 133-135.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.