iPhoneAlle anzeigen
iPhone 11iPhone 11 ProiPhone 11 Pro MaxiPhone 12iPhone 12 ProiPhone 12 Pro MaxiPhone 12 miniiPhone 13iPhone 13 ProiPhone 13 Pro MaxiPhone 13 miniiPhone 14iPhone 14 PlusiPhone 14 ProiPhone 14 Pro MaxiPhone 15iPhone 15 PlusiPhone 15 ProiPhone 15 Pro MaxiPhone 16iPhone 16 PlusiPhone 16 ProiPhone 16 Pro MaxiPhone 16eiPhone 5iPhone 5CiPhone 5SiPhone 6iPhone 6 PlusiPhone 6SiPhone 6S PlusiPhone 7iPhone 7 PlusiPhone 8iPhone 8 PlusiPhone SEiPhone SE 2020iPhone SE 2022iPhone XiPhone XRiPhone XSiPhone XS Max
NokiaAlle anzeigen
108 Reihe220 Reihe225 Reihe2600 classic Reihe2680 slide Reihe2710 Reihe3120 classic Reihe3220 Reihe500 Reihe515 Reihe5230 Reihe603 Reihe6131 Reihe6200 Reihe6300 Reihe6500 Reihe6700 Reihe700 Reihe7200 Reihe8310 ReiheAshaC1C2C3C5C6C7E51E52E6E63E65E7E71E72N73N8N9N95N97Nokia 3Nokia 4.2Nokia 5Nokia 6Nokia 7Nokia 8SiroccoWeitere ModelleXX2X3X6XLXpressMusic
Galaxy A-SerieAlle anzeigen
Galaxy A12Galaxy A13Galaxy A13 5GGalaxy A14Galaxy A15Galaxy A16Galaxy A17Galaxy A17 5GGalaxy A20eGalaxy A21Galaxy A22Galaxy A23Galaxy A24Galaxy A25Galaxy A26 5GGalaxy A3Galaxy A32Galaxy A33Galaxy A34Galaxy A35Galaxy A36 5GGalaxy A37Galaxy A40Galaxy A41Galaxy A42Galaxy A50Galaxy A51Galaxy A52Galaxy A53Galaxy A54Galaxy A55Galaxy A56 5GGalaxy A57 5GGalaxy A70Galaxy A71Galaxy A72
Redmi SeriesAlle anzeigen
Redmi 10Redmi 13CRedmi 15 5GRedmi Note 10Redmi Note 10 ProRedmi Note 11Redmi Note 11 ProRedmi Note 11 Pro Plus 5GRedmi Note 11sRedmi Note 12Redmi Note 12 5GRedmi Note 12 ProRedmi Note 12 Pro 5GRedmi Note 12 Pro PlusRedmi Note 13Redmi Note 13 5GRedmi Note 13 ProRedmi Note 13 Pro PlusRedmi Note 14Redmi Note 14 Pro PlusRedmi Note 15Redmi Note 15 5GRedmi Note 15 ProRedmi Note 15 Pro 5GRedmi Note 15 Pro Plus 5GRedmi Note 8Redmi Note 8 ProRedmi Note 9Redmi Note 9 Pro
- Startseite
Bücher Wissen & Bildung Englische Bücher Naturwissenschaft, Medizin, Informatik, Technik Informatik & EDV Informatik Computability and Complexity Theory
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Computability and Complexity Theory
Steven Homer, Alan L. Selman (Broschiert, Englisch)
★★★★★
☆☆☆☆☆ Keine Bewertungen vorhanden
Optischer Zustand
Beschreibung
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of… complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:a chapter on nonuniformity studying Boolean circuits, advice classes and the important result of Karp─Lipton.a chapter studying properties of the fundamental probabilistic complexity classesa study of the alternating Turing machine and uniform circuit classes. an introduction of counting classes, proving the famous results of Valiant and Vazirani and of Todaa thorough treatment of the proof that IP is identical to PSPACE With its accessibility and well-devised organization, this text/reference is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates, and professionals involved in theoretical computer science, complexity theory, and computability will find the book an essential andpractical learning tool. Topics and features: Concise, focused materials cover the most fundamental concepts and results in the field of modern complexity theory, including the theory of NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems for other complexity classes Contains information that otherwise exists only in research literature and presents it in a unified, simplified mannerProvides key mathematical background information, including sections on logic and number theory and algebra Supported by numerous exercises and supplementary problems for reinforcement and self-study purposes 90,94 €
Broschiert | Neu
oder
zzgl.
Du kannst wie immer einen Kaufalarm setzen, wenn du auf das gebrauchte Buch warten möchtest.
zzgl.
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Technische Daten
Erscheinungsdatum
03.03.2014
Sprache
Englisch
EAN
9781489989710
Herausgeber
Springer US
Serien- oder Bandtitel
Texts in Computer Science
Sonderedition
Nein
Autor
Steven Homer, Alan L. Selman
Seitenanzahl
300
Auflage
2
Einbandart
Broschiert
Schlagwörter
Computability, NP-Completeness, Nondeterminism, Nonuniform Complexity, Parallelism, computational complexity, counting classes, interactive proof systems, probabilistic complexity classes, relative computability, undecidability, algorithm analysis and problem complexity
Thema-Inhalt
UYA - Theoretische Informatik
UMB - Algorithmen und Datenstrukturen
Höhe
235 mm
Breite
15.5 cm
Transparenz & Sicherheit
Hersteller: Springer, Europaplatz 3, Heidelberg, Deutschland, 69115, ProductSafety@springernature.com, Springer Nature Customer Service Center GmbH
-.-
★★★★★
☆☆☆☆☆ Leider noch keine Bewertungen
Leider noch keine Bewertungen
Sicher bei rebuy kaufen
Schreib die erste Bewertung für dieses Produkt!
Wenn du eine Bewertung für dieses Produkt schreibst, hilfst du allen Kund:innen, die noch überlegen, ob sie das Produkt kaufen wollen. Vielen Dank, dass du mitmachst!
Sicher bei rebuy kaufen