What Can (and Can't) we Do with Sparse Polynomials?-Reference-Cited by-同舟云学术

What Can (and Can't) we Do with Sparse Polynomials?

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Roche Daniel S.¹

Affiliation:

1. United States Naval Academy, Annapolis, MD, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference87 articles.

1. F. Amoroso and M. Sombra. Factorization of bivariate sparse polynomials. online 2017. URL https://arxiv.org/abs/1710.11479. F. Amoroso and M. Sombra. Factorization of bivariate sparse polynomials. online 2017. URL https://arxiv.org/abs/1710.11479.

2. Error-Correcting Sparse Interpolation in the Chebyshev Basis

3. Multivariate sparse interpolation using randomized Kronecker substitutions

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

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

1. Interpolation by decomposable univariate polynomials;Journal of Complexity;2024-12

2. 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

3. 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

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

5. Termination of triangular polynomial loops;Formal Methods in System Design;2023-12-04