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.
€83.02
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim PDF ● ISBN 9783540274773 ● Çevirmen R. Pruim ● Yayımcı Springer Berlin Heidelberg ● Yayınlanan 2005 ● İndirilebilir 6 kez ● Döviz EUR ● Kimlik 6952078 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir
Aynı yazardan daha fazla e-kitap / Editör
16.592 Bu kategorideki e-kitaplar
