Abstract
We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we give problems for computing the reduced Gröbner bases and show how to solve these problems.
| Originalsprache | Englisch |
|---|---|
| Titel | Internatial Conference on Mathematical Aspects of Computer and Information Sciences |
| Herausgeber*innen | Wang and D. and Zheng and Z. |
| Seiten | 15-32 |
| Seitenumfang | 18 |
| Publikationsstatus | Veröffentlicht - 2006 |
Wissenschaftszweige
- 101 Mathematik
- 101001 Algebra
- 101005 Computeralgebra
- 101009 Geometrie
- 101012 Kombinatorik
- 101013 Mathematische Logik
- 101020 Technische Mathematik
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver