Disproves a prior quasi-linear claim for integer sparse polynomial multiplication and supplies a quasi-linear bit-complexity algorithm via modular interpolation, plus a linear-bit algorithm over finite fields.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
unclear 1representative citing papers
libwignernj is a new open-source library for exact evaluation of Wigner symbols, Clebsch-Gordan coefficients, and Gaunt coefficients using prime-factorization and exact rational arithmetic with multi-language bindings.
An algorithm is provided for selecting distinguished defining polynomials for p-adic field extensions, serving as a key component in expanding the LMFDB p-adic fields database.
citing papers explorer
-
libwignernj: a reusable C/C++/Fortran/Python library for exact Wigner symbols and related coefficients
libwignernj is a new open-source library for exact evaluation of Wigner symbols, Clebsch-Gordan coefficients, and Gaunt coefficients using prime-factorization and exact rational arithmetic with multi-language bindings.