Pages that link to "Item:Q2402419"
From MaRDI portal
The following pages link to Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix (Q2402419):
Displaying 16 items.
- Solving systems of linear equations over polynomials (Q1082773) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- (Q4227350) (← links)
- Fast parallel Hermite normal form computation of matrices over $$\mathbb{F}[x]$$ (Q4251976) (← links)
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices (Q4729243) (← links)
- Computing Hermite Normal Form Faster via Solving System of Linear Equations (Q5121118) (← links)
- On polynomially solvable constrained input selections for fixed and switched linear structured systems (Q6088368) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Segre-driven radicality testing (Q6184180) (← links)
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases (Q6650574) (← links)
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives (Q6652914) (← links)
- Solving norm equations in global function fields (Q6660938) (← links)
- Lazy Hermite reduction and creative telescoping for algebraic functions (Q6666522) (← 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)
