Computability and Complexity Theory

• Κύριοι συγγραφείς: Homer, Steven (Συγγραφέας), Selman, Alan L. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US : Imprint: Springer, 2011.
• Έκδοση: 2.
• Σειρά: Texts in Computer Science,
• Θέματα: Computer science.; Computers.; Algorithms.; Computer Science.; Theory of Computation.; Algorithm Analysis and Problem Complexity.

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 mov...

Πίνακας περιεχομένων:

• Preliminaries
• Introduction to Computability
• Undecidability
• Introduction to Complexity Theory
• Basic Results of Complexity Theory
• Nondeterminism and NP-Completeness
• Relative Computability
• Nonuniform Complexity
• Parallelism
• Probabilistic Complexity Classes
• Introduction to Counting Classes
• Interactive Proof Systems
• References
• Author Index
• Subject Index.