Computational ideal theory in finitely generated extension rings

Since Buchberger introduced the theory of Gröbner bases in 1965 it has become an important tool in constructive algebra and, nowadays, Buchberger's method is fundamental for many algorithms in the theory of polynomial ideals and algebraic geometry. Motivated by the results in polynomial rings a...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 244; no. 1; pp. 1 - 33
Main Author:	Apel, Joachim
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 06.08.2000 Elsevier
Subjects:	Algebra Algebraic algorithms Algebraic geometry Algorithmics. Computability. Computer arithmetics Applied sciences Computable algebraic structures Computer science; control theory; systems Exact sciences and technology Groebner bases in graded structures Mathematics Nonassociative rings and algebras Sciences and techniques of general use Theoretical computing F.u.1 I.1.2 Algebraic algorithms Computable algebraic structures Groebner bases in graded structures F.2.2 Annihilation Gröbner basis Noether theorem Ideal Algebraic algorithm Algebraic struture Group theory Buchberger algorithm Graded structure Algorithm Computability
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!