Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
From MaRDI portal
Publication:2819758
DOI10.1145/2755996.2756647zbMath1345.68285OpenAlexW2072518300MaRDI QIDQ2819758
Bruno Grenet, Joris van der Hoeven, Grégoire Lecerf
Publication date: 29 September 2016
Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2755996.2756647
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Implementing the Tangent Graeffe Root Finding Method ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ On the computation of rational solutions of underdetermined systems over a finite field ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ A Generalised Successive Resultants Algorithm
Uses Software
This page was built for publication: Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
