Completeness and Reduction in Algebraic Complexity Theory

By:

Peter Burgisser

Format:

Hardback

Series:

Algorithms and Computation in Mathematics

Show Hide Adult Content

$271.99

RRP:: ~~$307.95~~ save $35.96

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $68.00 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 2-12 July using International Courier

Description

The theory of NP-completeness is a cornerstone of computational complexity. This monograph provides a thorough and comprehensive treatment of this concept in the framework of algebraic complexity theory. Many of the results presented are new and published for the first time.Topics include: complete treatment of 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.The book can be used at the advanced undergraduate or at the beginning graduate level in either mathematics or computer science.

Release date Australia

June 21st, 2000

Author

Peter Burgisser

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational
Undergraduate

Illustrations

xii, 168 p.

Pages

168

Series

Algorithms and Computation in Mathematics

Dimensions

156x234x12

ISBN-13

9783540667520

Product ID

2495252

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here