Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...
Number theoretic transform (NTT) is widely recognized as the most efficient method for computing polynomial multiplication with high dimension and integral coefficients, due to its quasilinear ...
Vesselin Dimitrov’s proof of the Schinzel-Zassenhaus conjecture quantifies the way special values of polynomials push each other apart. In the physical world, objects often push each other apart in an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results