APA (7th ed.) Citation

Babenko, A. V., & Vyalyi, M. N. (2017). On the linear classification of even and odd permutation matrices and the complexity of computing the permanent. Computational mathematics and mathematical physics, 57(2), 362-371. https://doi.org/10.1134/S0965542517020038

Chicago Style (17th ed.) Citation

Babenko, A. V., and M. N. Vyalyi. "On the Linear Classification of Even and Odd Permutation Matrices and the Complexity of Computing the Permanent." Computational Mathematics and Mathematical Physics 57, no. 2 (2017): 362-371. https://doi.org/10.1134/S0965542517020038.

MLA (9th ed.) Citation

Babenko, A. V., and M. N. Vyalyi. "On the Linear Classification of Even and Odd Permutation Matrices and the Complexity of Computing the Permanent." Computational Mathematics and Mathematical Physics, vol. 57, no. 2, 2017, pp. 362-371, https://doi.org/10.1134/S0965542517020038.