Polynomial modular product verification and its implications
From MaRDI portal
Publication:2100047
DOI10.1016/j.jsc.2022.08.011OpenAlexW4287393204MaRDI QIDQ2100047
Armelle Perret du Cray, Pascal Giorgi, Bruno Grenet
Publication date: 21 November 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.02142
bit complexitypolynomial multiplicationmodular multiplicationverification algorithmdense and sparse polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chunky and equal-spaced polynomial multiplication
- Sparse polynomial division using a heap
- Computing Fibonacci numbers (and similarly defined functions) in log time
- On fast multiplication of polynomials over arbitrary algebras
- A probabilistic remark on algebraic program testing
- A probabilistic algorithm for verifying polynomial middle product in linear time
- On the bit-complexity of sparse polynomial and series multiplication
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Approximate formulas for some functions of prime numbers
- Integer multiplication in time \(O(n\log n)\)
- Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication
- Handbook of Finite Fields
- Modern Computer Algebra
- Parallel sparse polynomial multiplication using heaps
- Structured FFT and TFT
- Powers of tensors and fast matrix multiplication
- A note on probabilistically verifying integer and polynomial products
- Verifying candidate matches in sparse and wildcard matching
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On the Evaluation of Powers
- What Can (and Can't) we Do with Sparse Polynomials?
- Nearly Optimal Sparse Polynomial Multiplication
- Essentially optimal sparse polynomial multiplication
- On the complexity of multivariate blockwise polynomial multiplication
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: Polynomial modular product verification and its implications
