Details:
Title | | Author(s) | Thomas W. , Bud Mishra, Chee-K. K. Yap | Type | Technical Report, Misc | Abstract | The 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. | Length | 28 |
File |
| Language | English | Year | 1995 | Translation |
No | Refereed |
No |
|