Artículos relacionados a Complexity Theory: Exploring the Limits of Efficient...

Complexity Theory: Exploring the Limits of Efficient Algorithms - Tapa dura

R. Pruim

 
9783540210450: Complexity Theory: Exploring the Limits of Efficient Algorithms

Sinopsis

Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models All topics are considered from an algorithmic point of view stressing the implications for algorithm design

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.

De la contraportada

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:

New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.

The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.

"Sobre este título" puede pertenecer a otra edición de este libro.