Geometry and complexity theory / J.M. Landsberg, Texas A&M University.

Landsberg, J. M.
Call Number
516.3/5
Author
Landsberg, J. M., author.
Title
Geometry and complexity theory / J.M. Landsberg, Texas A&M University.
Physical Description
1 online resource (xi, 339 pages) : digital, PDF file(s).
Series
Cambridge studies in advanced mathematics ; 169
Notes
Title from publisher's bibliographic system (viewed on 24 Oct 2017).
Summary
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.
Subject
COMPUTATIONAL COMPLEXITY.
GEOMETRY, ALGEBRAIC.
Multimedia
Total Ratings: 0
No records found to display.
 
 
 
02257nam a22003738i 4500
001
 
 
vtls001584288
003
 
 
VRT
005
 
 
20200921121700.0
006
 
 
m|||||o||d||||||||
007
 
 
cr||||||||||||
008
 
 
200921s2017||||enk     o     ||1 0|eng|d
020
$a 9781108183192 (ebook)
020
$z 9781107199231 (hardback)
035
$a (UkCbUP)CR9781108183192
039
9
$y 202009211217 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA267.7 $b .L35 2017
082
0
0
$a 516.3/5 $2 23
100
1
$a Landsberg, J. M., $e author.
245
1
0
$a Geometry and complexity theory / $c J.M. Landsberg, Texas A&M University.
264
1
$a Cambridge : $b Cambridge University Press, $c 2017.
300
$a 1 online resource (xi, 339 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
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.
650
0
$a GEOMETRY, ALGEBRAIC.
776
0
8
$i Print version: $z 9781107199231
830
0
$a Cambridge studies in advanced mathematics ; $v 169.
856
4
0
$u https://doi.org/10.1017/9781108183192
999
$a VIRTUA               
No Reviews to Display
Summary
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.
Notes
Title from publisher's bibliographic system (viewed on 24 Oct 2017).
Subject
COMPUTATIONAL COMPLEXITY.
GEOMETRY, ALGEBRAIC.
Multimedia