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
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
This thesis explores two territories of computer science: complexity and compression. More precisely...
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...
In recent years a number of algorithms have been designed for the "inverse" computational ...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
In this paper we present various algorithms for multiplying multivariate polynomials and series. All...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
AbstractThis paper presents an introduction to some of the more algebraic applications of elementary...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
This thesis explores two territories of computer science: complexity and compression. More precisely...
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...
In recent years a number of algorithms have been designed for the "inverse" computational ...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
In this paper we present various algorithms for multiplying multivariate polynomials and series. All...
The research presented focuses on optimization of polynomials using algebraic manipulations at the h...
Computational complexity is the study of the resources — time, memory, …— needed to algorithmically ...
International audienceThe Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations...
We provide a comprehensive presentation of algorithms, data structures, and implementation technique...
AbstractThis paper presents an introduction to some of the more algebraic applications of elementary...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
International audienceAlgebra and number theory have always been counted among the most beautiful ma...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
This thesis explores two territories of computer science: complexity and compression. More precisely...