Bøger af Peter Burgisser

This book deals with condition as a main aspect in the understanding of the performance-regarding both stability and complexity-of numerical algorithms. It offers partial solutions for Smale's 17th problem.

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;

Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem.