Full Product Details
Author: D. Wang
Publisher: Springer Verlag GmbH
Imprint: Springer Verlag GmbH
Edition: Softcover reprint of the original 1st ed. 2001
Dimensions:
Width: 17.00cm
, Height: 1.40cm
, Length: 24.40cm
Weight: 0.522kg
ISBN: 9783211832417
ISBN 10: 3211832416
Pages: 244
Publication Date: 30 November 2000
Audience:
College/higher education
,
Professional and scholarly
,
Postgraduate, Research & Scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: Out of stock
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.
Reviews
.,. the algorithms are presented in a a ~crescendoa (TM) sequence, that is, the versions are improved step by step with the introduction of new techniques and concepts, which allows the readers to follow the construction of the ideas; furthermore, this style makes it a very good textbook ... it is a very good text to have on hand for anyone interested in the theories and techniques of elimination methods.a American Mathematical Society .,. This book, therefore, is not only topical, but is also the first book that contains all major currently available algorithmic approaches on elimination theory in one conceptional frame ... The book is well suited both as a textbook and as a research reference for the state of the art in algorithmic elimination theory. Theorems and proofs are presented in such a way that the correctness of the algorithms based on them can easily be verified. Well-chosen examples make it easy to understand the concepts and the methods. The main contents of this book - altough not all details - should enter standard curricula on algebra. Association for Computing Machinery
... the algorithms are presented in a 'crescendo' sequence, that is, the versions are improved step by step with the introduction of new techniques and concepts, which allows the readers to follow the construction of the ideas; furthermore, this style makes it a very good textbook ... it is a very good text to have on hand for anyone interested in the theories and techniques of elimination methods. American Mathematical Society ... This book, therefore, is not only topical, but is also the first book that contains all major currently available algorithmic approaches on elimination theory in one conceptional frame ... The book is well suited both as a textbook and as a research reference for the state of the art in algorithmic elimination theory. Theorems and proofs are presented in such a way that the correctness of the algorithms based on them can easily be verified. Well-chosen examples make it easy to understand the concepts and the methods. The main contents of this book - altough not all details - should enter standard curricula on algebra. Association for Computing Machinery
... the algorithms are presented in a 'crescendo' sequence, that is, the versions are improved step by step with the introduction of new techniques and concepts, which allows the readers to follow the construction of the ideas; furthermore, this style makes it a very good textbook ... it is a very good text to have on hand for anyone interested in the theories and techniques of elimination methods. American Mathematical Society ... This book, therefore, is not only topical, but is also the first book that contains all major currently available algorithmic approaches on elimination theory in one conceptional frame ... The book is well suited both as a textbook and as a research reference for the state of the art in algorithmic elimination theory. Theorems and proofs are presented in such a way that the correctness of the algorithms based on them can easily be verified. Well-chosen examples make it easy to understand the concepts and the methods. The main contents of this book - altough not all details - should enter standard curricula on algebra. Association for Computing Machinery
