A01=Joel S. Cohen
Algebraic Number
Algebraic Number Fields
Author_Joel S. Cohen
Automatic Simplification
Category=PBF
Category=UYA
Coefficient Domain
Computer Algebra Systems
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_non-fiction
Extended Euclidean Algorithm
Gcd Computation
Greatest Common Divisor
Integral Domain
Irreducible Polynomial
Mathematical Expressions
Minimal Polynomial
Monic Polynomial
Multiplicative Inverse
Multivariate Polynomials
Non-zero Polynomials
Nonzero Polynomials
Partial Fraction
Partial Fraction Expansion
Polynomial Decomposition
Polynomial Division
Polynomial Expansion
Positive Degree
Square Free Polynomial
Unique Factorization Domain
Product details
- ISBN 9781568811598
- Weight: 1020g
- Dimensions: 152 x 229mm
- Publication Date: 03 Jan 2003
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Mathematica, Maple, and similar software packages provide programs that carry out sophisticated mathematical operations. Applying the ideas introduced in Computer Algebra and Symbolic Computation: Elementary Algorithms, this book explores the application of algorithms to such methods as automatic simplification, polynomial decomposition, and polynomial factorization. This book includes complexity analysis of algorithms and other recent developments. It is well-suited for self-study and can be used as the basis for a graduate course. Maintaining the style set by Elementary Algorithms, the author explains mathematical methods as needed while introducing advanced methods to treat complex operations.
Joel S. Cohen
Qty: