Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0747-7171(08)80034-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103078973 / rank | |||
Normal rank | |||
Latest revision as of 09:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of factoring and calculating the GCD of linear ordinary differential operators |
scientific article |
Statements
Complexity of factoring and calculating the GCD of linear ordinary differential operators (English)
0 references
1990
0 references
For linear differential operator L with rational coefficients the author studies an algorithm to factor L.
0 references
factoring
0 references
linear differential operator with rational coefficients
0 references
0 references
