Robotics Research Technical Report: Admissible Orderings and Bounds for Grobner Basis Normal Form Algorithms (Classic Reprint) - Softcover

Inhaltsangabe

Excerpt from Robotics Research Technical Report: Admissible Orderings and Bounds for Grobner Basis Normal Form Algorithms

In this paper we are interested in a bound on the number of reduc tion steps in the normal form algorithm. Previously, the only bounds known are for the simple case where 3 is the total degree ordering. In [mishra and Yap a bound for the lexicographic ordering was given. We now extend this bound to the general case. Along the way, we will develop an elementary and constructive proof of a characterization theo rem for all admissible orderings. The characterization was first given by [robbiano 1985] but his proof is highly non-constructive.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.