Complexity Theory: Exploring the Limits of Efficient Algorithms - Rilegato

Wegener, Ingo

 
9783540210450: Complexity Theory: Exploring the Limits of Efficient Algorithms
Rilegato
ISBN 10: 3540210458 ISBN 13: 9783540210450
Casa editrice: Springer Nature, 2005

Sinossi

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

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

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.

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer Nature
Data di pubblicazione
2005
Lingua
Inglese
ISBN 10 
3540210458
ISBN 13 
9783540210450
Rilegatura
Copertina rigida
Numero di pagine
308
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania

Altre edizioni note dello stesso titolo

9783642059148: Complexity Theory: Exploring the Limits of Efficient Algorithms

Edizione in evidenza

ISBN 10:  3642059147 ISBN 13:  9783642059148
Casa editrice: Springer, 2010
Brossura