000			nam a22 7a 4500
999			_c39122 _d39122
008			190304b2017 xxu||||| |||| 00| 0 eng d
020			_a9781107199231
082			_a516.35 LAN-J
100			_aLandsberg, J. M.
245			_aGeometry and complexity theory / _cJ. M. Landsberg
260			_aUnited Kingdom _bCambridge University Press _c2017
300			_a339 p.
365			_aGBP _b50.00.
440			_aCambridge studies in advanced mathematics. _v169.
500			_aTwo 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			_aComputational complexity
650			_aGeometry, Algebraic