Computability and Complexity
Produktnummer:
1882408e045f8f407daa3b1cadc443b53d
| Autor: | Downey, Rod |
|---|---|
| Themengebiete: | Finite automata NP-completeness Parameterized complexity Recursion Reducability Structural complexity |
| Veröffentlichungsdatum: | 11.05.2024 |
| EAN: | 9783031537431 |
| Sprache: | Englisch |
| Seitenzahl: | 346 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer International Publishing |
| Untertitel: | Foundations and Tools for Pursuing Scientific Applications |
Produktinformationen "Computability and Complexity"
This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question? How can we show that none is possible? How computationally hard is the question we are concerned with? Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps? Can we perform some algorithm with only a limited memory? Does randomness help? Are there standard approaches to overcoming computational difficulty?
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen