書 正版 Fundamental Problems of Algorithmic Algebra的詳細資訊
書籍為正版書籍 ,部分絕版書籍,為舊書或者二手書籍,建議咨詢客服
1.書籍均為簡體正版書籍,大陸版社直接寄送。部分絕版書籍為二手二手書籍
2.貨物3天內安排寄送,到貨時間大概8~12天,有時間要求請及時聯繫。
3.圖書因物流運送且多為單冊包裝,偶有碰撞折損潮損,非無法閱讀均不可退貨,完美要求者請切勿下標。
4.大物件商品超過超區規格,需要下標宅配到付哦 。
5.可免費代尋書籍!店鋪每天上新歡迎關注!
6.收到商品有任何問題,歡迎咨詢,感謝~
開 本:16開
紙 張:輕型紙
包 裝:精裝
是否套裝:否
國際標準書號ISBN:9780195125160
所屬分類:圖書>英文原版書>科學與技術 Science & Techology
Fundamental Problems of Algorithmic Algebra
作者: Yap, Chee Keng
出版社: Oxford University Press, USA (1999年12月29日)
頁數: 528頁
語種: 英語
ISBN: 9780195125160
條形碼: 9780195125160
商品重量: 1070.00g
商品尺寸: 24.31cm * 19.96cm * 3.48cm
編輯推薦
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, 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
Review Citations
Choice 10/01/2000 pg.367 (EAN 9780195125160)商品備註・物品狀況:全新・最新關注時間:2025-08-06