arXiv · 0704.1257
Complexity of Janet basis of a D-module
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öbner 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alexander Chistov, Dima Grigoriev. 2007-04-10. Complexity of Janet basis of a D-module. https://arxiv.org/abs/0704.1257
Cite the original work for its findings. Save a collection to share your selection of sources.