Certification of Minimal Approximant Bases

DOI10.1145/3208976.3208991zbMath1467.68054arXiv1802.01920OpenAlexW2963519708MaRDI QIDQ5120192

Pascal Giorgi, Vincent Neiger

Publication date: 9 September 2020

Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.01920

zbMATH Keywords

polynomial matrixcertificationorder basisminimal approximant basistruncated product

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical models of computation (68Q09)

Related Items (2)

Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ Verification protocols with sub-linear communication for polynomial matrix operations

This page was built for publication: Certification of Minimal Approximant Bases