Completeness and Reduction in Algebraic Complexity Theory

Peter Bürgisser

$251.95 $201.58

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Springer Verlag
01 June 2000

Mathematics & Sciences; Mathematical logic; Applied mathematics; Mathematical theory of computation

Series: Algorithms and Computation in Mathematics

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.

By: Peter Bürgisser
Imprint: Springer Verlag
Country of Publication: Germany
Volume: v. 7
Dimensions: Height: 235mm, Width: 155mm, Spine: 12mm
Weight: 970g
ISBN: 9783540667520
ISBN 10: 3540667520
Series: Algorithms and Computation in Mathematics
Pages: 186
Publication Date: 01 June 2000
Audience: College/higher education , Professional and scholarly , Professional & Vocational , A / AS level , Further / Higher Education
Format: Hardback
Publisher's Status: Active

Reviews for Completeness and Reduction in Algebraic Complexity Theory

... The subject matter of the book is not easy, since it involves prerequisites from several areas, among them complexity theory, combinatorics, analytic number theory, and representations of symmetric and general linear groups. But the author goes to great lengths to motivate his results, to put them into perspective, and to explain the proofs carefully. In summary, this monograph advances its area of algebraic complexity theory, and is a must for people for working on this subject. And it is a pleasure to read. Joachim von zur Gathen, Mathematical Reviews, Issue 2001g