Complexity of Janet basis of a D-module

Details Complexity of Janet basis of a D-module Complexity of Janet basis of a D-module

2007-04-10

arxiv.org/abs/0704.1257v1

Mathematics

Analysis of PDEs

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Complexity of Janet basis of a D-module does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Janet basis of a D-module, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Janet basis of a D-module will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-207751