Computer Algebra and Differential Equations 1994
DOI: 10.1017/cbo9780511565816.003
|View full text |Cite
|
Sign up to set email alerts
|

D-modules: an overview towards effectivity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

1997
1997
2016
2016

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…One of the earliest such approaches are in [34,4], but at least implicitly Buchberger's algorithm in a Weyl algebra was discussed as early as [70]. An algorithmic approach to the isolated singularities case [144] preceded the general algorithms based on Gröbner bases in a non-commutative setting outlined below. 10.1.…”
Section: Appendix: Computability (By a Leykin)mentioning
confidence: 99%
“…One of the earliest such approaches are in [34,4], but at least implicitly Buchberger's algorithm in a Weyl algebra was discussed as early as [70]. An algorithmic approach to the isolated singularities case [144] preceded the general algorithms based on Gröbner bases in a non-commutative setting outlined below. 10.1.…”
Section: Appendix: Computability (By a Leykin)mentioning
confidence: 99%
“…In such a field, the coefficients are not necessarily constants ∈ K, but belongs to a ring of functions. We refer to [17], [16], for more information on this topic.…”
Section: Notationsmentioning
confidence: 99%
“…Proof. If T d is a bound for the coefficients in U k and A k at the step d, according to (13), (16), the size of the coefficients at the step d+1 is bounded by…”
Section: Complexitymentioning
confidence: 99%