Computability and Complexity Theory (Texts in Computer Science) - Hardcover
Buch 30 von 83: Texts in Computer Science
Inhaltsangabe
Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Computability and Complexity Theory (Texts in Computer...
Beispielbild für diese ISBN
Computability and Complexity Theory
Verlag:
Springer-Verlag New York Inc., 2001
ISBN 10: 0387950559
ISBN 13: 9780387950556
Gebraucht
Hardcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Très bon. Ancien livre de bibliothèque. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations. Artikel-Nr. E-577-788
Gebraucht kaufen
EUR 6,49
EUR 16,50 Versand
Versand von Frankreich nach USA
Versand von Frankreich nach USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Texts in Computer Science: Computability and Complexity Theory
Anbieter: Bookbot, Prague, Tschechien
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: As New. Leichte Kratzer / Abnutzungen / Druckstellen. This volume presents essential materials in the theory of computation, structured to be self-contained. It begins with a chapter on key mathematical concepts and notations, then progresses from qualitative aspects of classical computability to the quantitative dimensions of complexity theory. Dedicated chapters explore undecidability, NP-completeness, and relative computability, emphasizing the limitations of computability and the distinction between feasible and intractable problems. Key topics include fundamental concepts in modern complexity theory, such as NP-completeness, NP-hardness, the polynomial hierarchy, and complete problems across complexity classes. The book consolidates information typically found only in research literature, simplifying complex topics like complements of complexity classes, search problems, and intermediate problems in NP. It also provides essential mathematical background, covering logic, number theory, and algebra. Numerous exercises and supplementary problems are included to reinforce learning and support self-study. With its accessible format and logical organization, this text serves as an excellent resource for those seeking a solid foundation in computing theory. It is particularly valuable for beginning graduates, advanced undergraduates, and professionals in theoretical computer science, complexity theory, and computability. Artikel-Nr. ed16d363-4975-44d0-b3a5-aae0a886e4ae
Gebraucht kaufen
EUR 15,28
EUR 20,99 Versand
Versand von Tschechien nach USA
Versand von Tschechien nach USA
Anzahl: 1 verfügbar