Complexity Theory Exploring the Limits of Efficient Algorithms
1-
- Hardcover
- Taschenbuch
- eBook ausgewählt
-
Form:Einzelkauf Download
-
Sprache:Englisch
Fr. 93.90
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Nein
Family Sharing
Nein
Text-to-Speech
Nein
Erscheinungsdatum
05.07.2005
Verlag
SpringerSeitenzahl
308 (Printausgabe)
Dateigröße
2392 KB
Übersetzt von
R. Pruim
Sprache
Englisch
EAN
9783540274773
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficient algorithms. The theory of NP-completeness has influenced the development of all areas of computer science. New branches of complexity theory react to all new algorithmic concepts. This textbook considers randomization as a key concept. The chosen subjects have implications to concrete applications. The significance of complexity theory for today's computer science is stressed.