The following pages link to (Q4660659):
Displaying 38 items.
- A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery (Q376164) (← links)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- Efficient algorithms for order basis computation (Q420746) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Message length effects for solving polynomial systems on a hypercube (Q1121641) (← links)
- On fast computation of a polynomial in the Frobenius matrix (Q1571128) (← links)
- A behavioral approach to classic polynomial matrix descriptions (Q1575611) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Computing syzygies in finite dimension using fast linear algebra (Q2192678) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← 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)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419) (← links)
- Factoring polynomials over global fields. II. (Q2456609) (← links)
- Validated numerical computation of the \(\mathcal L_{\infty}\)-norm for linear dynamical systems (Q2457358) (← links)
- Normal forms for general polynomial matrices (Q2457359) (← links)
- Output-sensitive modular algorithms for polynomial matrix normal forms (Q2470057) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- On Multiple Eigenvalues of a Matrix Dependent on a Parameter (Q2830007) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory (Q6123057) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives (Q6652914) (← links)
- Algorithms for linearly recurrent sequences of truncated polynomials (Q6666538) (← links)
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices (Q6666544) (← links)
