Get Free Shipping on orders over $79
Algebraic Complexity Theory : Grundlehren der mathematischen Wissenschaften - T. Lickteig

Algebraic Complexity Theory

By: T. Lickteig, Peter Bürgisser, Michael Clausen

Hardcover | 1 December 1996

At a Glance

Hardcover


$343.75

or 4 interest-free payments of $85.94 with

 or 

Ships in 10 to 15 business days

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 of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.
Industry Reviews

P. B¼rgisser, M. Clausen, M.A. Shokrollahi, and T. Lickteig

Algebraic Complexity Theory

"The book contains interesting exercises and useful bibliographical notes. In short, this is a nice book."-MATHEMATICAL REVIEWS

From the reviews:

"This book is certainly the most complete reference on algebraic complexity theory that is available hitherto. ... superb bibliographical and historical notes are given at the end of each chapter. ... this book would most certainly make a great textbook for a graduate course on algebraic complexity theory. ... In conclusion, any researchers already working in the area should own a copy of this book. ... beginners at the graduate level who have been exposed to undergraduate pure mathematics would find this book accessible." (Anthony Widjaja, SIGACT News, Vol. 37 (2), 2006)

Other Editions and Formats

Paperback

Published: 5th December 2010

More in Mathematics

How to Win At Chess : The Ultimate Guide for Beginners and Beyond - Levy Rozman
A Little History of Mathematics : Little Histories - Snezana Lawrence
Humble Pi : A Comedy of Maths Errors - Matt Parker

RRP $26.99

$22.99

15%
OFF
The Golden Ratio : Divine Beauty of Mathematics - Gary B. Meisner

RRP $59.99

$45.75

24%
OFF
Statistics and Data Handling for Biologists : A Student's Guide - Neil Millar
The Score : How to Stop Playing Someone Else's Game - C. Thi Nguyen
Dynamics of Marine Structures - Yingguang  Wang

RRP $503.95

$442.99

12%
OFF
Calculus : 9th edition - Early Transcendentals, Metric - James Michael Stewart
Discrete Mathematics with Applications, Metric Edition : 5th edition - Susanna S. Epp
Antifragile : Things That Gain from Disorder - Nassim Nicholas Taleb

RRP $27.99

$23.75

15%
OFF
Oxford Maths for Australian Schools Year 4 Value Pack : 3rd Edition - Annie Facchinetti
The Infinite Game : From the bestselling author of Start With Why - Simon Sinek