Hochschulschrift
Optimal algorithms for binomial ideals and commutative semigroups
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
VIII, 141 S.
- Language
-
Englisch
- Notes
-
Ill., graph. Darst.
München, Techn. Univ., Diss., 1997
- Keyword
-
Abelsche Halbgruppe
Polynomideal
Gröbner-Basis
- Creator
-
Koppenhagen, Ulla
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:52 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Koppenhagen, Ulla
Other Objects (12)
Optimal algorithms for binomial ideals and commutative semigroups
Radicals of Binomial Ideals and Commutative Thue Systems
Representations of commutative semitopological semigroups
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Algorithms and complexity results for finite semigroups
When is a Polynomial Ideal Binomial After an Ambient Automorphism?
Semigroups
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
Generalized Binomial Trees
Optimal algorithms for binomial ideals and commutative semigroups
Radicals of Binomial Ideals and Commutative Thue Systems
Representations of commutative semitopological semigroups
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Algorithms and complexity results for finite semigroups
When is a Polynomial Ideal Binomial After an Ambient Automorphism?
Semigroups
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
Generalized Binomial Trees
Optimal algorithms for binomial ideals and commutative semigroups
Radicals of Binomial Ideals and Commutative Thue Systems
Representations of commutative semitopological semigroups
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Algorithms and complexity results for finite semigroups
When is a Polynomial Ideal Binomial After an Ambient Automorphism?
Semigroups
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs