Author:
Davenport James Harold,Carette Jacques
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16
2. So the problem has poor complexity: what next?;2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2023-09-11
3. The Rôle of Benchmarking in Symbolic Computation (Position Paper);2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2018-09
4. What Can (and Can't) we Do with Sparse Polynomials?;Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation;2018-07-11
5. Methodologies of Symbolic Computation;Artificial Intelligence and Symbolic Computation;2018