Lagarde, G., Limaye, N., & Srinivasan, S. (2019). Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Computational complexity, 28(3), 471-542. https://doi.org/10.1007/s00037-018-0171-9
Citácia podle Chicago (17th ed.)Lagarde, Guillaume, Nutan Limaye, a Srikanth Srinivasan. "Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees." Computational Complexity 28, no. 3 (2019): 471-542. https://doi.org/10.1007/s00037-018-0171-9.
Citácia podľa MLA (8th ed.)Lagarde, Guillaume, et al. "Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees." Computational Complexity, vol. 28, no. 3, 2019, pp. 471-542, https://doi.org/10.1007/s00037-018-0171-9.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..