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
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप PDF ● ISBN 9783540274773 ● अनुवादक R. Pruim ● प्रकाशक Springer Berlin Heidelberg ● प्रकाशित 2005 ● डाउनलोड करने योग्य 6 बार ● मुद्रा EUR ● आईडी 6952078 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
16,592 इस श्रेणी में ईबुक
