Complexity of Janet basis of a D-module

From MaRDI portal
Publication:6205260

arXiv0704.1257MaRDI QIDQ6205260FDOQ6205260


Authors: A. L. Chistov, Dima Grigoriev Edit this on Wikidata


Publication date: 10 April 2007

Abstract: We prove a double-exponential upper bound on the degree and on the complexity of constructing a Janet basis of a D-module. This generalizes a well known bound on the complexity of a Gr"obner basis of a module over the algebra of polynomials. We would like to emphasize that the obtained bound can not be immediately deduced from the commutative case.













This page was built for publication: Complexity of Janet basis of a D-module

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205260)