The origins of the mathematics in this book date back more than two thou sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu clid. The word "algorithm" as well as the key word "algebra" in the title of this book come from the name and the work of the ninth-century scientist Mohammed ibn Musa al-Khowarizmi, who was born in what is now Uzbek istan and worked in Baghdad at the court of Harun al-Rashid’s son. The word "algorithm" is actually a westernization of al-Khowarizmi’s name, while "algebra" derives from "al-jabr," a term that appears in the title of his book Kitab al-jabr wa’l muqabala, where he discusses symbolic methods for the solution of equations. This close connection between algebra and al gorithms lasted roughly up to the beginning of this century; until then, the primary goal of algebra was the design of constructive methods for solving equations by means of symbolic transformations. During the second half of the nineteenth century, a new line of thought began to enter algebra from the realm of geometry, where it had been successful since Euclid’s time, namely, the axiomatic method.
"Sinopsis" puede pertenecer a otra edición de este libro.
The origins of the mathematics in this book date back more than two thou sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu clid. The word "algorithm" as well as the key word "algebra" in the title of this book come from the name and the work of the ninth-century scientist Mohammed ibn Musa al-Khowarizmi, who was born in what is now Uzbek istan and worked in Baghdad at the court of Harun al-Rashid's son. The word "algorithm" is actually a westernization of al-Khowarizmi's name, while "algebra" derives from "al-jabr," a term that appears in the title of his book Kitab al-jabr wa'l muqabala, where he discusses symbolic methods for the solution of equations. This close connection between algebra and al gorithms lasted roughly up to the beginning of this century; until then, the primary goal of algebra was the design of constructive methods for solving equations by means of symbolic transformations. During the second half of the nineteenth century, a new line of thought began to enter algebra from the realm of geometry, where it had been successful since Euclid's time, namely, the axiomatic method.
This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the Gaussian elimination algorithm to multivariate polynomial rings. The book explains how the Buchberger algorithm and the theory surrounding it are eminently important both for the mathematical theory and for computational applications. A number of results such as optimized version of the Buchberger algorithm are presented in textbook format for the first time. This book requires no prerequisites other than the mathematical maturity of an advanced undergraduate and is therefore well suited for use as a textbook. At the same time, the comprehensive treatment makes it a valuable source of reference on Gr bner bases theory for mathematicians, computer scientists, and others. Placing a strong emphasis on algorithms and their verification, while making no sacrifices in mathematical rigor, the book spans a bridge between mathematics and computer science.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Hardcover. Condición: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G0387979719I4N00
Cantidad disponible: 1 disponibles
Librería: Renaissance Books, ANZAAB / ILAB, Dunedin, Nueva Zelanda
Hardcover. Condición: Good+. Estado de la sobrecubierta: No Dust Jacket. First Edition. Ex-library. Library stamps and markings. ; xxii, [1], 574, [2] pages. Hardcover. Papered boards. Page dimensions: 234 x 152mm. Contents: Preface; How to Use This Book; List of Algorithms; Basics; Commutative Rings with Unity; Polynomial Rings; Vector Spaces and Modules; Orders and Abstract Reduction Relations; Grobner Bases; First Applications of Grobner Bases; Field Extensions and the Hilbert Nullstellensatz; Decomposition, Radical, and Zeroes of Ideals; Linear Algebra in Residue Class Rings; Variations on Grobner Bases; Appendix: Outlook on Advanced and Related Topics; Selected Bibliography; List of Symbols; Index. ; Graduate Texts in Mathematics; Ex-Library; Vol. 141; 8vo. Nº de ref. del artículo: 10874
Cantidad disponible: 1 disponibles
Librería: Toscana Books, AUSTIN, TX, Estados Unidos de America
Hardcover. Condición: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Nº de ref. del artículo: Scanned0387979719
Cantidad disponible: 1 disponibles
Librería: Fireside Bookshop, Stroud, GLOS, Reino Unido
Cloth/Laminated Boards. Condición: Very Good. Type: Book N.B. Small gold label to ffep. Nº de ref. del artículo: 051368
Cantidad disponible: 1 disponibles
Librería: Antiquariat Bernhardt, Kassel, Alemania
Karton. Condición: Sehr gut. Zust: Gutes Exemplar. 574 Seiten, mit Abbildungen, Englisch 1020g. Nº de ref. del artículo: 360646
Cantidad disponible: 1 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Feb2215580175175
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 672393-n
Cantidad disponible: Más de 20 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 672393
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. Hardcover. This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the Gaussian elimination algorithm to multivariate polynomial rings. The book explains how the Buchberger algorithm and the theory surrounding it are eminently important both for the mathematical theory and for computational applications. A number of results such as optimized version of the Buchberger algorithm are presented in textbook format for the first time. This book requires no prerequisites other than the mathematical maturity of an advanced undergraduate and is therefore well suited for use as a textbook. At the same time, the comprehensive treatment makes it a valuable source of reference on Gr bner bases theory for mathematicians, computer scientists, and others. Placing a strong emphasis on algorithms and their verification, while making no sacrifices in mathematical rigor, the book spans a bridge between mathematics and computer science. The origins of the mathematics in this book date back more than two thou sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu clid. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9780387979717
Cantidad disponible: 1 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780387979717_new
Cantidad disponible: Más de 20 disponibles