𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm to determine the Buchsbaum property and invariant for polynomial ideals

✍ Scribed by Henrik Bresinsky; Wolfgang Vogel

Book ID
112905828
Publisher
Springer-Verlag
Year
1994
Tongue
German
Weight
336 KB
Volume
40
Category
Article
ISSN
0430-3202

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced GrΓΆbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 404 KB

It is known that the reduced GrΓΆbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by KΓΌhnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper

An algorithm for the computer calculatio
An algorithm for the computer calculation of the coefficients of a polynomial that allows determination of isoelectric points of proteins and other macromolecules
✍ JoΓ£o Meireles Ribeiro; Antonio Sillero πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 623 KB

The isoelectric point (~1) of a macromolecule containing any number of acid-base residues can be expressed as a polynomial whose coefficients are related to both the number of acid-base residues present in the molecule and their K values. Polynomials of degree higher than 5 are too complicated to be