Proposed algorithm achieves bit complexity of O(n(log n)(log log n)^2) for polynomials in binary field, indicating efficiency.
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is O(n(log n)(loglog n)²).
No takes yet. Share an insight, caveat, or question.
Chunlei Liu (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: