Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleAdmissible Orderings and Bounds for Gröbner Basis Normal Form Algorithms
Author(s) Thomas W. Dubé, Bud Mishra, Chee-K. K. Yap
TypeTechnical Report, Misc
AbstractThe concepts of admissible orderings and normal form algorithm are basic in Buchberger's Grobner basis algorithm. We present a constructive and elementary proof of Robbiano's characterization theorem for admissible orderings. Using this characterization, we give a bound on the complexity of the normal form algorithm for arbitrary admissible orderings. Using a simple refinement of the normal form algorithm (ordered reductions), we obtain significantly improved bounds.
Length28
File
LanguageEnglish
Year1995
Translation No
Refereed No
Webmaster