Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA
TLDR
The design of this generic library LinBox is described, its current range of capabilities are sketched, its guiding design principle of re-usability is given, and several examples of its use are given.
View via Publisher
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
TLDR
This article studies high performance implementations of basic linear algebra routines over word size prime fields: especially matrix multiplication, with the goal being to provide an exact alternate to the numerical BLAS library.
View on ACM
On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
  • J. Dumas
  • Mathematics
    IEEE Transactions on Computers
  • 28 September 2012
TLDR
A hybrid combination of the explicit formula for the inverse of Newton-Raphson iteration over p-adic numbers and the best asymptotic variants is proposed, which yields then a constant factor improvement, also for large exponents.
View on IEEE
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
TLDR
Alternative approaches to the calculation of simplicial homology are described and motivating examples and actual experiments with the GAP package that was implemented by the authors are described.
View via Publisher
FFPACK: finite field linear algebra package
TLDR
This paper shows that those optimal complexity algorithms, such as LSP factorization, rank determinant and inverse computation can also be the most efficient.
View on ACM
Efficient computation of the characteristic polynomial
TLDR
A probabilistic approach, based on integer minimal polynomial and Hensel factorization, is particularly well suited to sparse and/or structured matrices.
View on ACM
Essentially optimal interactive certificates in linear algebra
TLDR
All the authors' certificates are based on interactive verification protocols with the interaction removed by a Fiat-Shamir identification heuristic, and the validity of the verification procedure is subject to standard computational hardness assumptions from cryptography.
View on ACM
Finite field linear algebra subroutines
TLDR
Very efficient implementations of finite field dot products, matrix-vector products and matrix-matrix products (namely the symbolic equivalent of level 1, 2 and 3 BLAS) are presented.
View on ACM
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen
TLDR
Physical algorithms to realize zero-knowledge proofs for these logic games which allow a player to show that he knows a solution without revealing it are given and can be realized with simple office material as they only rely on cards and envelopes.
View PDF on arXiv
On Efficient Sparse Integer Matrix Smith Normal Form Computations
We present a new algorithm to compute the Integer Smith normal form of large sparse matrices. We reduce the computation of the Smith form to independent, and therefore parallel, computations modulo…
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License