Generic Reductions for In-place Polynomial Multiplication-Reference-Cited by-同舟云学术

Generic Reductions for In-place Polynomial Multiplication

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

Author:

Giorgi Pascal¹,Grenet Bruno¹,Roche Daniel S.²

Affiliation:

1. LIRMM, Univ. Montpellier, CNRS, Montpellier, France

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

Funder

National Science Foundation

Conseil Régional Languedoc-Roussillon

Publisher

ACM

Link

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

Reference25 articles.

1. Time-space tradeoffs for branching programs contrasted with those for straight-line programs

2. Alin Bostan Frédéric Chyzak Marc Giusti Romain Lebreton Grégoire Lecerf Bruno Salvy and Éric Schost. 2017. Algorithmes Efficaces en Calcul Formel 1 ed.). Alin Bostan Frédéric Chyzak Marc Giusti Romain Lebreton Grégoire Lecerf Bruno Salvy and Éric Schost. 2017. Algorithmes Efficaces en Calcul Formel 1 ed.).

3. Tellegen's principle into practice

4. Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

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

1. In-place fast polynomial modular remainder;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. In-place accumulation of fast multiplication formulae;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

3. An FPGA based Method of Polynomial Multiplication;2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML);2022-03

4. Blockchain-Based Secure Outsourcing of Polynomial Multiplication and Its Application in Fully Homomorphic Encryption;Security and Communication Networks;2021-06-24

5. Fast in-place algorithms for polynomial operations;Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation;2020-07-20