Essentially optimal sparse polynomial multiplication-Reference-Cited by-同舟云学术

Essentially optimal sparse polynomial multiplication

Published:2020-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Giorgi Pascal¹,Grenet Bruno¹,Cray Armelle Perret du¹

Affiliation:

1. Univ. Montpellier, Montpellier, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3373207.3404026

Reference25 articles.

1. A. Arnold. 2016. Sparse polynomial interpolation and testing. Ph.D. Dissertation. University of Waterloo. A. Arnold. 2016. Sparse polynomial interpolation and testing. Ph.D. Dissertation. University of Waterloo.

2. Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

3. Multivariate sparse interpolation using randomized Kronecker substitutions

4. A deterministic algorithm for sparse multivariate polynomial interpolation

5. Verifying candidate matches in sparse and wildcard matching

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast interpolation and multiplication of unbalanced polynomials;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Sparse polynomial interpolation: faster strategies over finite fields;Applicable Algebra in Engineering, Communication and Computing;2024-04-27

4. Removing Additive Structure in 3SUM-Based Reductions;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Polynomial modular product verification and its implications;Journal of Symbolic Computation;2023-05