
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:
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:
Inhaltsverzeichnis
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.
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "Computability and Complexity Theory" und helfen Sie damit anderen bei der Kaufentscheidung.