Algorithms for the computation of free resolutions
From MaRDI portal
Computing free resolutions of modules over commutative rings is an important problem in commutative algebra. The paper under review discusses some known algorithms for polynomial rings, using Gröbner basis techniques. The algorithms are presented in pseudo code and their running times are compared, using an implementation in SINGULAR. For the entire collection see [Zbl 0903.00035].
Recommendations
Cited in
(9)- Computing minimal finite free resolutions
- Recursive computation of free resolutions and a generalized Koszul complex
- On constructing resolutions over the polynomial algebra
- Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications
- On the computation of minimal free resolutions with integer coefficients
- scientific article; zbMATH DE number 3918515 (Why is no real title available?)
- scientific article; zbMATH DE number 1263424 (Why is no real title available?)
- On the free resolution induced by a Pommaret basis
- Massively parallel methods for free resolutions
This page was built for publication: Algorithms for the computation of free resolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247794)
