Geometry and Complexity Theory (Cambridge Studies in Advanced Mathematics)
J. M. Landsberg
- 出版商: Cambridge
- 出版日期: 2017-09-28
- 售價: $2,700
- 貴賓價: 9.5 折 $2,565
- 語言: 英文
- 頁數: 350
- 裝訂: Hardcover
- ISBN: 1107199239
- ISBN-13: 9781107199231
-
相關分類:
Computer-Science、Computer-networks
立即出貨 (庫存=1)
買這商品的人也買了...
-
$1,575State Estimation for Robotics
-
$714$678 -
$1,200$948 -
$1,680$1,596
相關主題
商品描述
Two central problems in computer science are P vs NP and the complexity of matrix multiplication. The first is also a leading candidate for the greatest unsolved problem in mathematics. The second is of enormous practical and theoretical importance. Algebraic geometry and representation theory provide fertile ground for advancing work on these problems and others in complexity. This introduction to algebraic complexity theory for graduate students and researchers in computer science and mathematics features concrete examples that demonstrate the application of geometric techniques to real world problems. Written by a noted expert in the field, it offers numerous open questions to motivate future research. Complexity theory has rejuvenated classical geometric questions and brought different areas of mathematics together in new ways. This book will show the beautiful, interesting, and important questions that have arisen as a result.
商品描述(中文翻譯)
計算機科學中的兩個核心問題是P vs NP和矩陣乘法的複雜度。前者也是數學中最重要的未解問題之一。後者在實際和理論上都具有巨大的重要性。代數幾何和表示論為推進這些問題以及複雜性中的其他問題提供了豐富的研究基礎。這本針對計算機科學和數學研究生和研究人員的代數複雜性理論介紹了具體的例子,展示了幾何技巧應用於現實世界問題的方法。由該領域的知名專家撰寫,書中提供了許多開放問題以激勵未來的研究。複雜性理論使傳統的幾何問題焕發了新的活力,並以新的方式將數學的不同領域聯繫在一起。本書將展示由此產生的美麗、有趣和重要的問題。