Sparse polynomial (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sparse polynomial" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6ams.org

451^st place

277^th place

5arxiv.org

69^th place

59^th place

5semanticscholar.org

11^th place

8^th place

ams.org

mathscinet.ams.org

Rédei, L. (1973), Lacunary polynomials over finite fields, translated by Földes, I., Elsevier, MR 0352060
Khovanskiĭ, A. G. (1991), Fewnomials, Translations of Mathematical Monographs, vol. 88, translated by Zdravkovska, Smilka, Providence, Rhode Island: American Mathematical Society, doi:10.1090/mmono/088, ISBN 0-8218-4547-0, MR 1108621
Nakos, Vasileios (2020), "Nearly optimal sparse polynomial multiplication", IEEE Transactions on Information Theory, 66 (11): 7231–7236, arXiv:1901.09355, doi:10.1109/TIT.2020.2989385, MR 4173637, S2CID 59316578
Pan, Victor Y. (2020), "Acceleration of subdivision root-finding for sparse polynomials", Computer algebra in scientific computing, Lecture Notes in Computer Science, vol. 12291, Cham: Springer, pp. 461–477, doi:10.1007/978-3-030-60026-6_27, ISBN 978-3-030-60025-9, MR 4184190, S2CID 224820309
Zippel, Richard (1979), "Probabilistic algorithms for sparse polynomials", Symbolic and algebraic computation (EUROSAM '79, Internat. Sympos., Marseille, 1979), Lecture Notes in Computer Science, vol. 72, Berlin, New York: Springer, pp. 216–226, MR 0575692
Cohen, S. D.; Movahhedi, A.; Salinier, A. (1999), "Galois groups of trinomials", Journal of Algebra, 222 (2): 561–573, doi:10.1006/jabr.1999.8033, MR 1734229

arxiv.org

Roche, Daniel S. (2018), "What can (and can't) we do with sparse polynomials?", in Kauers, Manuel; Ovchinnikov, Alexey; Schost, Éric (eds.), Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, Association for Computing Machinery, pp. 25–30, arXiv:1807.08289, doi:10.1145/3208976.3209027, ISBN 978-1-4503-5550-6, S2CID 49868973
Nakos, Vasileios (2020), "Nearly optimal sparse polynomial multiplication", IEEE Transactions on Information Theory, 66 (11): 7231–7236, arXiv:1901.09355, doi:10.1109/TIT.2020.2989385, MR 4173637, S2CID 59316578
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2020), "Essentially optimal sparse polynomial multiplication", Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (ISSAC '20)., Association for Computing Machinery, pp. 202–209, arXiv:2001.11959, doi:10.1145/3373207.3404026, ISBN 978-1-4503-7100-1, S2CID 211003922
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2021), "On Exact Division and Divisibility Testing for Sparse Polynomials", Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation (ISSAC '21)., Association for Computing Machinery, pp. 163–170, arXiv:2102.04826, doi:10.1145/3452143.3465539, ISBN 978-1-4503-8382-0, S2CID 231855563
Averkov, Gennadiy; Scheiderer, Claus (2023-03-07). "Convex hulls of monomial curves, and a sparse positivstellensatz". arXiv:2303.03826 [math.OC].

doi.org

Khovanskiĭ, A. G. (1991), Fewnomials, Translations of Mathematical Monographs, vol. 88, translated by Zdravkovska, Smilka, Providence, Rhode Island: American Mathematical Society, doi:10.1090/mmono/088, ISBN 0-8218-4547-0, MR 1108621
Roche, Daniel S. (2018), "What can (and can't) we do with sparse polynomials?", in Kauers, Manuel; Ovchinnikov, Alexey; Schost, Éric (eds.), Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, Association for Computing Machinery, pp. 25–30, arXiv:1807.08289, doi:10.1145/3208976.3209027, ISBN 978-1-4503-5550-6, S2CID 49868973
Nakos, Vasileios (2020), "Nearly optimal sparse polynomial multiplication", IEEE Transactions on Information Theory, 66 (11): 7231–7236, arXiv:1901.09355, doi:10.1109/TIT.2020.2989385, MR 4173637, S2CID 59316578
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2020), "Essentially optimal sparse polynomial multiplication", Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (ISSAC '20)., Association for Computing Machinery, pp. 202–209, arXiv:2001.11959, doi:10.1145/3373207.3404026, ISBN 978-1-4503-7100-1, S2CID 211003922
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2021), "On Exact Division and Divisibility Testing for Sparse Polynomials", Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation (ISSAC '21)., Association for Computing Machinery, pp. 163–170, arXiv:2102.04826, doi:10.1145/3452143.3465539, ISBN 978-1-4503-8382-0, S2CID 231855563
Pan, Victor Y. (2020), "Acceleration of subdivision root-finding for sparse polynomials", Computer algebra in scientific computing, Lecture Notes in Computer Science, vol. 12291, Cham: Springer, pp. 461–477, doi:10.1007/978-3-030-60026-6_27, ISBN 978-3-030-60025-9, MR 4184190, S2CID 224820309
Cohen, S. D.; Movahhedi, A.; Salinier, A. (1999), "Galois groups of trinomials", Journal of Algebra, 222 (2): 561–573, doi:10.1006/jabr.1999.8033, MR 1734229

semanticscholar.org

api.semanticscholar.org

Roche, Daniel S. (2018), "What can (and can't) we do with sparse polynomials?", in Kauers, Manuel; Ovchinnikov, Alexey; Schost, Éric (eds.), Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018, Association for Computing Machinery, pp. 25–30, arXiv:1807.08289, doi:10.1145/3208976.3209027, ISBN 978-1-4503-5550-6, S2CID 49868973
Nakos, Vasileios (2020), "Nearly optimal sparse polynomial multiplication", IEEE Transactions on Information Theory, 66 (11): 7231–7236, arXiv:1901.09355, doi:10.1109/TIT.2020.2989385, MR 4173637, S2CID 59316578
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2020), "Essentially optimal sparse polynomial multiplication", Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (ISSAC '20)., Association for Computing Machinery, pp. 202–209, arXiv:2001.11959, doi:10.1145/3373207.3404026, ISBN 978-1-4503-7100-1, S2CID 211003922
Giorgi, Pascal; Grenet, Bruno; Perret du Cray, Armelle (2021), "On Exact Division and Divisibility Testing for Sparse Polynomials", Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation (ISSAC '21)., Association for Computing Machinery, pp. 163–170, arXiv:2102.04826, doi:10.1145/3452143.3465539, ISBN 978-1-4503-8382-0, S2CID 231855563
Pan, Victor Y. (2020), "Acceleration of subdivision root-finding for sparse polynomials", Computer algebra in scientific computing, Lecture Notes in Computer Science, vol. 12291, Cham: Springer, pp. 461–477, doi:10.1007/978-3-030-60026-6_27, ISBN 978-3-030-60025-9, MR 4184190, S2CID 224820309