z-logo
open-access-imgOpen Access
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
Author(s) -
David Harvey,
Joris van der Hoeven
Publication year - 2022
Publication title -
journal of the acm
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.672
H-Index - 134
eISSN - 1557-735X
pISSN - 0004-5411
DOI - 10.1145/3505584
Subject(s) - finite field , mathematics , prime (order theory) , multiplication (music) , binary logarithm , combinatorics , polynomial , time complexity , degree (music) , discrete mathematics , turing machine , field (mathematics) , running time , arithmetic , algorithm , pure mathematics , physics , mathematical analysis , acoustics , computation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom