Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
- Hardcover
- New
Seller: Biblios, frankfurt am main, hessen, GermanyBiblios
4-star seller
AbeBooks seller since September 10, 2024
Hardcover
Condition: New
US$ 496.47
US$ 11.56 shipping
Ships from Germany to U.S.A.
Quantity: 4 available
Add to basketFree 30-day returns
Item description from seller
PRINT ON DEMAND pp. xv + 511.
Seller Inventory # 182265789
- Title
- Fundamental Problems of Algorithmic Algebra
- Author
- Yap Chee-Keng Yap Chee Keng
- Publisher
- Oxford University Press
- Publication year
- 1999
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0195125169
- ISBN 13
- 9780195125160
Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.
Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.
Features
· Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system
· Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor
· Aims to be self-contained in its mathematical development
· Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students
Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.
Features
· Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system
· Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor
· Aims to be self-contained in its mathematical development
· Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students
"Synopsis" may belong to another edition of this title.
About the Author
Chee Keng Yap is at New York University.
"About the title" may belong to another edition of this title.
Biblios
frankfurt am main, hessen, Germany
4-star seller
AbeBooks seller since September 10, 2024
Shipping rates from Germany to U.S.A.
| Item | 25 to 45 business days | 8 to 14 business days |
|---|---|---|
| First item | US$ 11.56 | US$ 21.72 |
Payment methods
Store description
We carry a wide selection of books from South Asia, United States, UK.
Specialty
new books imported from india, uk, usaSeller's business information
Readingos GmbH
Kaiserstraße 47
Frankfurt am Main, Germany 60329
Shipping terms
To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.