ePrivacy and GPDR Cookie Consent by Cookie Consent

What to read after Complexity Theory?

Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Complexity Theory" by Ingo Wegener! 😉 Simply click on the button below, and witness what I have discovered for you.

Exciting news! I've found some fantastic books for you! 📚✨ Check below to see your tailored recommendations. Happy reading! 📖😊

Complexity Theory

Exploring the Limits of Efficient Algorithms

Ingo Wegener

Computers / Programming / General

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.

Do you want to read this book? 😳
Buy it now!

Are you curious to discover the likelihood of your enjoyment of "Complexity Theory" by Ingo Wegener? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.