In this paper we present the modular computing structures (MCS) defined on the set of polynomials over finite rings of integers. This article is a continuation of research on the development of modular number systems (MNS) on arbitrary mathematical structures such as finite groups, rings and Galois fields [1-7]
In this paper, we consider the problem of efficient computation of polynomial modular reduction: A(x...
AbstractIn this paper we investigate the parallelization of two modular algorithms. In fact, we cons...
We consider the problem of computing the monic gcd of two polyno-mials over a number field L = Q(α1,...
This article is a continuation of research on the modular computing structures defined on the set of...
We propose a new number representation and arithmetic for the elements of the ring of integers modul...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
In this chapter we present a parallel modular algorithm to compute all solutions with multiplicities...
In this paper, research in the field of modular computing structures defined on sets of Gaussians ar...
International audienceSince their introduction in 2004, Polynomial Modular Number Systems (PMNS) hav...
The present paper is a continuation of research in parallel information processing based on the tabu...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
To appear in Mathematics of Computation.We analyse and compare the complexity of several algorithms ...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a v...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
In this paper, we consider the problem of efficient computation of polynomial modular reduction: A(x...
AbstractIn this paper we investigate the parallelization of two modular algorithms. In fact, we cons...
We consider the problem of computing the monic gcd of two polyno-mials over a number field L = Q(α1,...
This article is a continuation of research on the modular computing structures defined on the set of...
We propose a new number representation and arithmetic for the elements of the ring of integers modul...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
In this chapter we present a parallel modular algorithm to compute all solutions with multiplicities...
In this paper, research in the field of modular computing structures defined on sets of Gaussians ar...
International audienceSince their introduction in 2004, Polynomial Modular Number Systems (PMNS) hav...
The present paper is a continuation of research in parallel information processing based on the tabu...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
To appear in Mathematics of Computation.We analyse and compare the complexity of several algorithms ...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a v...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
In this paper, we consider the problem of efficient computation of polynomial modular reduction: A(x...
AbstractIn this paper we investigate the parallelization of two modular algorithms. In fact, we cons...
We consider the problem of computing the monic gcd of two polyno-mials over a number field L = Q(α1,...