Bisht, P., & Volkovich, I. (2025). On Solving Sparse Polynomial Factorization Related Problems. Computational complexity, 34(1), 7. https://doi.org/10.1007/s00037-025-00268-5
Citácia podle Chicago (17th ed.)Bisht, Pranav, a Ilya Volkovich. "On Solving Sparse Polynomial Factorization Related Problems." Computational Complexity 34, no. 1 (2025): 7. https://doi.org/10.1007/s00037-025-00268-5.
Citácia podľa MLA (8th ed.)Bisht, Pranav, a Ilya Volkovich. "On Solving Sparse Polynomial Factorization Related Problems." Computational Complexity, vol. 34, no. 1, 2025, p. 7, https://doi.org/10.1007/s00037-025-00268-5.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..