000			02199nam a2200361 i 4500
001			CR9781108183192
003			UkCbUP
005			20240909192142.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			161025s2017||||enk o ||1 0|eng|d
020			_a9781108183192 (ebook)
020			_z9781107199231 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA267.7 _b.L35 2017
082	0	0	_a516.3/5 _223
100	1		_aLandsberg, J. M., _eauthor.
245	1	0	_aGeometry and complexity theory / _cJ.M. Landsberg, Texas A&M University.
264		1	_aCambridge : _bCambridge University Press, _c2017.
300			_a1 online resource (xi, 339 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge studies in advanced mathematics ; _v169
500			_aTitle from publisher's bibliographic system (viewed on 24 Oct 2017).
520			_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		0	_aComputational complexity.
650		0	_aGeometry, Algebraic.
776	0	8	_iPrint version: _z9781107199231
830		0	_aCambridge studies in advanced mathematics ; _v169.
856	4	0	_uhttps://doi.org/10.1017/9781108183192
942			_2ddc _cEB
999			_c9047 _d9047