Pages that link to "Item:Q420746"
From MaRDI portal
The following pages link to Efficient algorithms for order basis computation (Q420746):
Displaying 11 items.
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- Allowable processing orders in the accelerated cascade algorithm (Q1072941) (← links)
- Symbolic computations of first integrals for polynomial vector fields (Q2194771) (← links)
- Algorithms for simultaneous Hermite-Padé approximations (Q2200312) (← links)
- Deterministic computation of the characteristic polynomial in the time of matrix multiplication (Q2238844) (← links)
- A deterministic algorithm for inverting a polynomial matrix (Q2254681) (← 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)
- Efficient computation of order bases (Q2883842) (← links)
- (Q3626415) (← links)