Skip to content
Register Sign in Wishlist

Geometry and Complexity Theory

£51.99

Part of Cambridge Studies in Advanced Mathematics

  • Date Published: September 2017
  • availability: In stock
  • format: Hardback
  • isbn: 9781107199231

£ 51.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Presents numerous open questions as well as techniques for approaching them
    • Features state-of-the-art exposition of two central open questions
    • Contains more than two hundred exercises, many with hints or worked solutions
    Read more

    Reviews & endorsements

    'The book under review provides an introduction accessible to graduate students and researchers either in computer science or in geometry and representation theory expanding a useful bridge between these disciplines and unifying recent trends.' Felipe Zaldivar, MAA Reviews

    'Most of the book is self-contained, since it introduces the necessary concepts of algebraic geometry and representation theory when needed. Several exercises are provided (for some of which hints and answers are available at the end of the book), together with an assessment of their difficulty and importance, stimulating the reader to an active reading.' Matteo Gallet, MathSciNet

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: September 2017
    • format: Hardback
    • isbn: 9781107199231
    • length: 350 pages
    • dimensions: 235 x 156 x 24 mm
    • weight: 0.62kg
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. The complexity of matrix multiplication I
    3. The complexity of matrix multiplication II
    4. The complexity of matrix multiplication III
    5. The complexity of matrix multiplication IV
    6. Valiant's hypothesis I
    7. Valiant's hypothesis II
    8. Representation theory and its uses in complexity theory
    9. The Chow variety of products of linear forms
    10. Topics using additional algebraic geometry.

  • Author

    J. M. Landsberg, Texas A & M University
    J. M. Landsberg is Professor of Mathematics at Texas A & M University. He is a leading geometer working in complexity theory, with research interests in differential geometry, algebraic geometry, representation theory, the geometry and application of tensors, and most recently, algebraic complexity theory. The author of over sixty research articles and four books, he has given numerous intensive research courses and lectures at international conferences. He co-organized the fall 2014 semester 'Algorithms and Complexity in Algebraic Geometry' program at the Simons Institute for the Theory of Computing, University of California, Berkeley and served as the UC Berkeley Chancellor's Professor during the program.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×