ORDERINGS OF MONOMIAL IDEALS (2003)

Cached

Download Links

by Matthias Aschenbrenner, et al.
Citations:4 - 1 self

Active Bibliography

3 Finiteness theorems in stochastic integer programming – Matthias Aschenbrenner, Raymond Hemmecke - 2003
14 Finite generation of symmetric ideals – Matthias Aschenbrenner, Christopher J. Hillar - 2005
2 From well-quasi-ordered sets to better-quasi-ordered sets – Maurice Pouzet, Norbert Sauer
5 Gröbner Bases, Invariant Theory and Equivariant Dynamics – Karin Gatermann, Frederic Guyard - 1996
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals – Christopher J. Hillar, Abraham Martín Del Campo - 2011
2 Optimal Gröbner Base Algorithms for Binomial Ideals – Ulla Koppenhagen, Ernst W. Mayr - 1996
Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative – Ernst W. Mayr
9 An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals – Ulla Koppenhagen, Ernst W. Mayr - 1996
8 Well-quasi-ordering infinite graphs with forbidden finite planar minor – Robin Thomas - 1990
3 Finiteness Theorems for Graphs and Posets Obtained by Compositions – Jens Gustedt - 1998
8 An intuitionistic proof of Kruskal's Theorem – Wim Veldman, Wim Veldman, Subfaculteit Wiskunde - 2000
2 On the Relation Between Gröbner and Pommaret Bases – Daniel Mall - 1998
43 What's so special about Kruskal's Theorem AND THE ORDINAL Γ0? A SURVEY OF SOME RESULTS IN PROOF THEORY – Jean H. Gallier - 1991
7 CONNECTEDNESS OF HILBERT SCHEMES – Irena Peeva, Mike Stillman
8 A Survey of Recursive Combinatorics – William Gasarch
28 Multigraded Hilbert schemes – Mark Haiman, Bernd Sturmfels
4 A Note on Simple Termination of Infinite Term Rewriting Systems – Enno Ohlebusch - 1992
1 Properties of Infinite Reduction Paths in Untyped λ-Calculus – Morten Heine Sørensen, Morten Heine S��rensen
10 Simple Termination Revisited – Aart Middeldorp, Hans Zantema - 1994