On the complexity of computing syzygies (Q1117693)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4092768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing syzygies |
scientific article; zbMATH DE number 4092768 |
Statements
On the complexity of computing syzygies (English)
0 references
1988
0 references
\textit{G. Hermann} [Math. Ann. 95, 736-788 (1926)] gave an upper bound, double exponential in the number of variables, for the degrees of polynomials occuring in the minimal syzygies of a polynomial ideal. Here it is shown that this estimate cannot be improved and hence the complexity of computing syzygies is also double exponential. The result is obtained by a construction extending that of \textit{E. W. Mayr} and \textit{A. R. Meyer} [Adv. Math. 46, 305-329 (1982; Zbl 0506.03007)].
0 references
computer algebra exponential complexity
0 references
polynomial ideal
0 references
syzygies
0 references
0.7783432602882385
0 references
0.770810067653656
0 references
