Complexity Theory

Exploring the Limits of Efficient Algorithms

Ingo Wegener

PDF
ca. 83,43

Springer Berlin Heidelberg img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Anwendungs-Software

Beschreibung

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.

Weitere Titel in dieser Kategorie
Cover The Official Raspberry Pi Handbook 2026
The Makers of the Raspberry Pi Official magazine
Cover Coding Basics
Elise Kapoor
Cover Causal AI
Robert Osazuwa Ness
Cover Quarkus in Action
Martin Stefanko
Cover C# Concurrency
Nir Dobovizki
Cover INI Format Explained
Isabella Ramirez

Kundenbewertungen