Amazon.com: Fundamental Problems of Algorithmic Algebra (9780195125160): Chee Keng Yap: Books


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
More Buying Choices
Have one to sell? Sell yours here
Fundamental Problems of Algorithmic Algebra
 
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Fundamental Problems of Algorithmic Algebra [Hardcover]

Chee Keng Yap (Author)
4.0 out of 5 stars  See all reviews (1 customer review)

Price: $155.00 & this item ships for FREE with Super Saver Shipping. Details
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Friday, February 24? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Hardcover $155.00  
Paperback --  

Book Description

December 30, 1999 0195125169 978-0195125160
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

Frequently Bought Together

Customers buy this book with Algorithmic Algebra (Monographs in Computer Science) $70.52

Fundamental Problems of Algorithmic Algebra + Algorithmic Algebra (Monographs in Computer Science)
Price For Both: $225.52

Show availability and shipping details

  • This item: Fundamental Problems of Algorithmic Algebra

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • Algorithmic Algebra (Monographs in Computer Science)

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details



Editorial Reviews

About the Author

Chee Keng Yap is at New York University.

Product Details

  • Hardcover: 528 pages
  • Publisher: Oxford University Press, USA (December 30, 1999)
  • Language: English
  • ISBN-10: 0195125169
  • ISBN-13: 978-0195125160
  • Product Dimensions: 9.6 x 7.9 x 1.4 inches
  • Shipping Weight: 2.6 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #1,297,413 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

1 Review
5 star:    (0)
4 star:
 (1)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

10 of 12 people found the following review helpful:
4.0 out of 5 stars Make More Powerful Computer Algebra?, February 18, 2004
This review is from: Fundamental Problems of Algorithmic Algebra (Hardcover)
There was once a time when computer algebra seems amazingly exotic. Sure, computers could crunch raw numbers. But no surprises there. It was quite another event to see a computer factor a simple algebraic expression, or perform symbolic integration. Wow!

But now, computer algebra is available on such widespread packages as Mathematica and Maple. This book studies the subject, as a coherent entity. (Wish it had been available in 1982!) For those of you who might be interested in developing ever more sophisticated techniques in this field. It explains the ideas clearly. It shows that you can understand it systematically. And not as an ad hoc, grab bag of unrelated but nifty tricks. Brings together in one volume ideas that are scattered throughout many scientific papers over decades.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Inside This Book (learn more)
First Sentence:
This chapter considers the arithmetic operations (addition, subtraction, multiplication, and division) in three basic algebraic structures: polynomials, integers, and matrices. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
subresultant chain, ith quotient, isolating interval representation, easy fixup, real constructible, primitive factorization, cone decomposition, lucky primes, ground specialization, critical rows, polynomial remainder sequence, normal form algorithm, tail coefficient, regular continued fraction, isolating intervals, determinantal polynomials, ideal membership problem, shortest vector, shift decomposition, algorithmic algebra, indeterminate polynomials, convex body theorem, admissible orderings, inertial element, real algebraic numbers
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Basic Lemma, Subresultant Theorem, Partial Correctness Criteria, Extended Bareiss Algorithm, Applying Lemma, Remarks Our
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject