Fundamental Problems of Algorithmic Algebra
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Fundamental Problems of Algorithmic Algebra |
|---|---|
| Author / Organization | Chee-Keng Yap |
| Subject & Discipline | Algebra, Abstract Algebra, and Linear Algebra, Computational and Algorithmic Mathematics, Mathematical and Computational Software, Number Theory, Mathematics |
| Categories | Algebra, Abstract Algebra, and Linear Algebra |
| Publication Year | 1999 |
| ISBN | 0195125169 |
| Resource Verification | Access Restricted / Protected Host |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-76502 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Fundamental Problems of Algorithmic Algebra • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.