Completeness and Reduction in Algebraic Complexity Theory

Completeness and Reduction in Algebraic Complexity Theory
Author :
Publisher : Springer Science & Business Media
Total Pages : 174
Release :
ISBN-13 : 9783662041796
ISBN-10 : 3662041790
Rating : 4/5 (90 Downloads)

Book Synopsis Completeness and Reduction in Algebraic Complexity Theory by : Peter Bürgisser

Download or read book Completeness and Reduction in Algebraic Complexity Theory written by Peter Bürgisser and published by Springer Science & Business Media. This book was released on 2013-03-14 with total page 174 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity; fast evaluation of representations of general linear groups; and complexity of immanants.


Completeness and Reduction in Algebraic Complexity Theory Related Books

Completeness and Reduction in Algebraic Complexity Theory
Language: en
Pages: 174
Authors: Peter Bürgisser
Categories: Mathematics
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's alg
Algebraic Complexity Theory
Language: en
Pages: 630
Authors: Peter Bürgisser
Categories: Mathematics
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion
P, NP, and NP-Completeness
Language: en
Pages:
Authors: Oded Goldreich
Categories: Computers
Type: BOOK - Published: 2010-08-16 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems a
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Geometry and Complexity Theory
Language: en
Pages: 353
Authors: J. M. Landsberg
Categories: Computers
Type: BOOK - Published: 2017-09-28 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

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 unsolve