International audienceIn this work, we present the M4RIE library which implements efficient algorithms for linear algebra with dense matrices over GF(2^e) for 2 <= 2 <= 10. As the name of the library indicates, it makes heavy use of the M4RI library both directly (i.e., by calling it) and indirectly (i.e., by using its concepts). We provide an open-source GPLv2+ C library for efficient linear algebra over GF(2^e) for e small. In this library we implemented an idea due to Bradshaw and Boothby which reduces matrix multiplication over GF(p^k) to a series of matrix multiplications over GF(p). Furthermore, we propose a caching technique - Newton-John tables - to avoid finite field multiplications which is inspired by Kronrod's method ("M4RM") fo...
Title: Fast multiplication in the field GF(2n ) Author: Marek Bajtoš Department: Department of Algeb...
International audienceIn this paper, we discuss an implementation of various algorithms for multiply...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense mat...
International audienceWe present here algorithms for efficient computation of linear algebra problem...
Abstract. In this work we describe an efficient implementation of a hierarchy of algorithms for the ...
Can post-Schönhage–Strassen multiplication algorithms be competitive in practice for large input siz...
In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimi...
International audienceThis is a system paper about a new GPLv2 open source C libraryGBLA implementin...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
This paper introduces a new efficient algorithm for computing Gröbner-bases named M4GB. Like Faugère...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
This dissertation contains algorithms for solving linear and polynomial systems of equations over GF...
International audienceWe present block algorithms and their implementation for the parallelization o...
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when...
Title: Fast multiplication in the field GF(2n ) Author: Marek Bajtoš Department: Department of Algeb...
International audienceIn this paper, we discuss an implementation of various algorithms for multiply...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense mat...
International audienceWe present here algorithms for efficient computation of linear algebra problem...
Abstract. In this work we describe an efficient implementation of a hierarchy of algorithms for the ...
Can post-Schönhage–Strassen multiplication algorithms be competitive in practice for large input siz...
In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimi...
International audienceThis is a system paper about a new GPLv2 open source C libraryGBLA implementin...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
This paper introduces a new efficient algorithm for computing Gröbner-bases named M4GB. Like Faugère...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
This dissertation contains algorithms for solving linear and polynomial systems of equations over GF...
International audienceWe present block algorithms and their implementation for the parallelization o...
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when...
Title: Fast multiplication in the field GF(2n ) Author: Marek Bajtoš Department: Department of Algeb...
International audienceIn this paper, we discuss an implementation of various algorithms for multiply...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...