Computing minimal nullspace bases
From MaRDI portal
Publication:5244558
DOI10.1145/2442829.2442881zbMath1323.68633OpenAlexW2059887287MaRDI QIDQ5244558
Wei Zhou, Arne Storjohann, George Labahn
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2442829.2442881
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
Efficient rational creative telescoping, Computing minimal interpolation bases, Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix, Lagrangian constraints and differential Thomas decomposition, Algorithm for computing \(\mu\)-bases of univariate polynomials, Deterministic computation of the characteristic polynomial in the time of matrix multiplication, A deterministic algorithm for inverting a polynomial matrix
