The following pages link to Vincent Neiger (Q1701496):
Displaying 21 items.
- Algorithms for zero-dimensional ideals using linear recurrent sequences (Q1701497) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations (Q2978612) (← links)
- Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts (Q2985840) (← links)
- Fast Computation of Shifted Popov Forms of Polynomial Matrices via Systems of Modular Polynomial Equations (Q2985849) (← links)
- Two-Point Codes for the Generalized GK Curve (Q4682912) (← links)
- Fast Computation of the Roots of Polynomials Over the Ring of Power Series (Q5119960) (← links)
- Computing Canonical Bases of Modules of Univariate Relations (Q5119962) (← links)
- Certification of Minimal Approximant Bases (Q5120192) (← links)
- Computing Popov and Hermite Forms of Rectangular Polynomial Matrices (Q5120209) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension (Q5145999) (← links)
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation (Q5146000) (← links)
- Sparse FGLM using the block Wiedemann algorithm (Q5880526) (← links)