Add to ORKGThere are discussed implementational aspects of the special-purpose computer algebra system FELIX designed for computations in constructive algebra. In particular, data types developed for the representation of and computation with commutative and non-commutative polynomials are described. Furthermore, comparisons of time and memory requirements of different polynomial representations are reported
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This "habilitation à diriger des recherches" manuscript concerns the efficiency in exact linear alge...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
The special-purpose computer algebra system FELIX is designed for computations in constructive commu...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
In recent years a number of algorithms have been designed for the "inverse" computational ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
In the first part of the thesis we develop the theory of standard bases in free modules over (locali...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This "habilitation à diriger des recherches" manuscript concerns the efficiency in exact linear alge...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
There are discussed implementational aspects of the special-purpose computer algebra system FELIX de...
The special-purpose computer algebra system FELIX is designed for computations in constructive commu...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
In recent years a number of algorithms have been designed for the "inverse" computational ...
The extensive use of computers in mathematics and engineering has led to an increased demand for rel...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
How should one design and implement a program for the multiplication of sparse polynomials? This is ...
In the first part of the thesis we develop the theory of standard bases in free modules over (locali...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
This "habilitation à diriger des recherches" manuscript concerns the efficiency in exact linear alge...