Geometry and complexity theory

By:

Landsberg, J. M

Series: Cambridge studies in advanced mathematics ; 169Publication details: Cambridge University Press, 2017. Cambridge:Description: xi, 339 p. : ill. ; hb, 24 cmISBN:

9781107199231

Subject(s):

DDC classification:

516.35 LAN

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	IIT Gandhinagar General Stacks	General	516.35 LAN (Browse shelf(Opens below))	1	Available		030104

Browsing IIT Gandhinagar shelves, Shelving location: General Stacks, Collection: General Close shelf browser (Hides shelf browser)

Previous								Next
Previous	516.35 CAR Period mappings and period domains.	516.35 COR Integral points on algebraic varieties: an introduction to diophantine geometry	516.35 HIR Topological methods in algebraic geometry,	516.35 LAN Geometry and complexity theory	516.35 MUM Algebraic geometry I: complex projective varieties	516.35 OGU Lectures on logarithmic algebraic geometry	516.35 OLS Algebraic spaces and stacks	Next

Includes bibliographical references and index.

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.

There are no comments on this title.

to post a comment.