Algorithms for polynomial computation over finite fields form a crucial domain in computational mathematics, with extensive applications ranging from cryptography and ...
The deterministic factorization algorithm for polynomials over finite fields that was recently introduced by the author is based on a new type of linearization of the factorization problem. The main ...
Soient K un corps fini et Q ϵ K[T] un polynôme de degré au moins égal à 1. Une fonction f sur K[T] est dite (complètement) Q-additive si f(A + BQ) = f(A) + f(B) pour tous A, B ϵ K[T] tels que deg(A) < ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results