東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Geometry and complexity theory

Landsberg, J. M.

FindBook

Google Book

Amazon

博客來

Geometry and complexity theory

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Geometry and complexity theory/ J.M. Landsberg, Texas A&M University.
作者:	Landsberg, J. M.
出版者:	Cambridge :Cambridge University Press, : 2017.,
面頁冊數:	xi, 339 p. :ill., digital ;24 cm.
附註:	Title from publisher's bibliographic system (viewed on 24 Oct 2017).
標題:	Computational complexity. -
電子資源:	https://doi.org/10.1017/9781108183192
ISBN:	9781108183192

Geometry and complexity theory
Landsberg, J. M.

Geometry and complexity theory[electronic resource] /J.M. Landsberg, Texas A&M University. - Cambridge :Cambridge University Press,2017. - xi, 339 p. :ill., digital ;24 cm. - Cambridge studies in advanced mathematics ;169. - Cambridge studies in advanced mathematics ;169..

Title from publisher's bibliographic system (viewed on 24 Oct 2017).

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.

ISBN: 9781108183192Subjects--Topical Terms:

523870
Computational complexity.

LC Class. No.: QA267.7 / .L35 2017

Dewey Class. No.: 516.35

Geometry and complexity theory
LDR:01831nmm a2200265 a 4500 001 2227326
003 UkCbUP
005 20171027114857.0
006 m d
007 cr nn 008maaau
008 210414s2017 enk o 1 0 eng d
020 $a 9781108183192 $q (electronic bk.)
020 $a 9781107199231 $q (hardback)
035 $a CR9781108183192
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA267.7 $b .L35 2017
082 0 4 $a 516.35 $2 23
090 $a QA267.7 $b .L263 2017
100 1 $a Landsberg, J. M. $3 1575278
245 1 0 $a Geometry and complexity theory $h [electronic resource] / $c J.M. Landsberg, Texas A&M University.
260 $a Cambridge : $b Cambridge University Press, $c 2017.
300 $a xi, 339 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge studies in advanced mathematics ; $v 169
500 $a Title from publisher's bibliographic system (viewed on 24 Oct 2017).
520 $a 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.
650 0 $a Computational complexity. $3 523870
650 0 $a Geometry, Algebraic. $3 532048
830 0 $a Cambridge studies in advanced mathematics ; $v 169. $3 3470675
856 4 0 $u https://doi.org/10.1017/9781108183192