Efficient computation of order bases
From MaRDI portal
Publication:2883842
DOI10.1145/1576702.1576753zbMath1237.68263OpenAlexW2148496593MaRDI QIDQ2883842
Publication date: 13 May 2012
Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1576702.1576753
Related Items (4)
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Efficient algorithms for order basis computation ⋮ Simple forms of higher-order linear differential systems and their applications in computing regular solutions ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication
This page was built for publication: Efficient computation of order bases
