Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Algorithms for computing grobn...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Algorithms for computing grobner bases of polynomial ideals over various euclidean rings /
57
Bibliographic Details
Main Authors:
380234 Abdelilah Kandri-Rody
,
Deepak Kapur
Format:
Language:
eng
Subjects:
Algorithms
Computer algorithms
Holdings
Description
Similar Items
Staff View
Similar Items
A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings
by: Zhao Xiangui, et al.
Published: (2015-05-01)
Computing Comprehensive Grobner Systems: A Comparison of Two Methods
by: Amir Hashemi, et al.
Published: (2017-12-01)
A note on Computing SAGBI-Grobner bases in a Polynomial Ring over a Field
by: Hans Ofverbeck
Published: (2006-01-01)
Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
by: Cifuentes, Diego Fernando, et al.
Published: (2017)
Polynomial algorithms in computer algebra /
by: 347079 Winkler, Franz
Published: (1996)