New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such...
In an environment where the contexts of users are complex and the degree of freedom of user activity is very high, such as in daily life, several factors need to be considered for...
Hyoungnyoun Kim, Ig-Jae Kim, Hyoung-Gon Kim, Ji-Hy...
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...