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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 244; číslo 1; s. 1 - 33
Hlavní autor:	Apel, Joachim
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 06.08.2000 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!