69 citations · 167 across the 27 of their papers we have counts for
4 papers · 1 filter
Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations
David Lucas, Vincent Neiger, Clément Pernet +2
We design and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] of univariate polynomials over a field F. For the sake of effic…
Computing Popov and Hermite forms of rectangular polynomial matrices
Vincent Neiger, Johan Rosenkilde, Grigory Solomatov
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, de…
Certification of minimal approximant bases
Pascal Giorgi, Vincent Neiger
For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) t…
Fast computation of approximant bases in canonical form
Claude-Pierre Jeannerod, Vincent Neiger, Gilles Villard
In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our…