Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
- Hardcover
- Used
Hardcover
Condition: Used - Good
US$ 19.65
US$ 3.75 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.
Seller Inventory # S_425687950
- Title
- Fundamental Problems of Algorithmic Algebra
- Author
- Yap, Chee Keng
- Publisher
- Oxford University Press
- Publication year
- 1999
- Condition
- Good
- 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.
Shipping rates within U.S.A.
| Item | 4 to 14 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 3.75 | US$ 6.99 |
Payment methods
Store description
Half Price Books has been connecting readers to great books since 1972. Customer service is our top priority.
Specialty
AllSeller's business information
Half Price Books, Records, Magazines, Inc.
5803 E. Northwest Hwy.
Dallas, TX U.S.A. 75231