APA (7th ed.) Citation

Sergeev, I. S. (2019). On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates. Discrete Mathematics & Applications, 29(4), 241. https://doi.org/10.1515/dma-2019-0022

Chicago Style (17th ed.) Citation

Sergeev, Igor' S. "On the Complexity of Bounded-depth Circuits and Formulas over the Basis of Fan-in Gates." Discrete Mathematics & Applications 29, no. 4 (2019): 241. https://doi.org/10.1515/dma-2019-0022.

MLA (9th ed.) Citation

Sergeev, Igor' S. "On the Complexity of Bounded-depth Circuits and Formulas over the Basis of Fan-in Gates." Discrete Mathematics & Applications, vol. 29, no. 4, 2019, p. 241, https://doi.org/10.1515/dma-2019-0022.