APA (7th ed.) Citation

Suprun, V. P. (2017). The complexity of Boolean functions in the Reed–Muller polynomials class. Automatic control and computer sciences, 51(5), 285-293. https://doi.org/10.3103/S0146411617050078

Chicago Style (17th ed.) Citation

Suprun, V. P. "The Complexity of Boolean Functions in the Reed–Muller Polynomials Class." Automatic Control and Computer Sciences 51, no. 5 (2017): 285-293. https://doi.org/10.3103/S0146411617050078.

MLA (9th ed.) Citation

Suprun, V. P. "The Complexity of Boolean Functions in the Reed–Muller Polynomials Class." Automatic Control and Computer Sciences, vol. 51, no. 5, 2017, pp. 285-293, https://doi.org/10.3103/S0146411617050078.