The following pages link to (Q4234206):
Displaying 13 items.
- Computing homology using generalized Gröbner bases (Q386986) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- Some complexity results for prefix Gröbner bases in free monoid rings (Q846370) (← links)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
- An introduction to commutative and noncommutative Gröbner bases (Q1341746) (← links)
- Computational ideal theory in finitely generated extension rings (Q1575702) (← links)
- A general framework for Noetherian well ordered polynomial reductions (Q2000264) (← links)
- Flat families by strongly stable ideals and a generalization of Gröbner bases (Q2275904) (← links)
- Gröbner basis cryptosystems (Q2432557) (← links)
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings (Q2447635) (← links)
- Tree polynomials and non-associative Gröbner bases (Q2457336) (← links)
- Gröbner bases in function rings -- a guide for introducing reduction relations to algebraic structures (Q2457399) (← links)
- Buchberger-Weispfenning theory for effective associative rings (Q2628314) (← links)
