Hochschulschrift
Optimal algorithms for binomial ideals and commutative semigroups
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783826525971
3826525973
- Maße
-
21 cm
- Umfang
-
VIII, 141 S.
- Ausgabe
-
Als Ms. gedr.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Zugl.: München, Techn. Univ., Diss., 1997
- Schlagwort
-
Abelsche Halbgruppe
Polynomideal
Gröbner-Basis
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Shaker
- (wann)
-
1997
- Urheber
-
Koppenhagen, Ulla
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:50 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Koppenhagen, Ulla
- Shaker
Entstanden
- 1997
Ähnliche Objekte (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?
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
Semigroups
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?
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
Semigroups
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?
Hilbert-Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
Semigroups