APA (7th ed.) Citation

Kombarov, Y. A. (2021). Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In. Moscow University mathematics bulletin, 76(6), 266-270. https://doi.org/10.3103/S002713222106005X

Chicago Style (17th ed.) Citation

Kombarov, Yu. A. "Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In." Moscow University Mathematics Bulletin 76, no. 6 (2021): 266-270. https://doi.org/10.3103/S002713222106005X.

MLA (9th ed.) Citation

Kombarov, Yu. A. "Lower Bound of Circuit Complexity of Parity Function in a Basis of Unbounded Fan-In." Moscow University Mathematics Bulletin, vol. 76, no. 6, 2021, pp. 266-270, https://doi.org/10.3103/S002713222106005X.