Welcome to Loot.co.za! Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search

Checkout
- Your Cart Price

Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Applied mathematics

Buy Now

Completeness and Reduction in Algebraic Complexity Theory (Hardcover, 2000 ed.) Loot Price: R2,975

Discovery Miles 29 750

Repayment Terms: R279 pm x 12*

Add to cart

Completeness and Reduction in Algebraic Complexity Theory (Hardcover, 2000 ed.): Peter Burgisser

Completeness and Reduction in Algebraic Complexity Theory (Hardcover, 2000 ed.)

Peter Burgisser

Series: Algorithms and Computation in Mathematics, 7

(sign in to rate)

Loot Price R2,975 Discovery Miles 29 750 | Repayment Terms: R279 pm x 12*

Expected to ship within 10 - 15 working days

Description
Details
Customer Reviews

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Algorithms and Computation in Mathematics, 7
Release date:	June 2000
First published:	2000
Authors:	Peter Burgisser
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Hardcover
Pages:	168
Edition:	2000 ed.
ISBN-13:	978-3-540-66752-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	3-540-66752-0
Barcode:	9783540667520