Computability and Complexity TheorySpringer Science & Business Media, 2001 - 194 Seiten This volume introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability round off the work, which focuses on the limitations of computability and the distinctions between feasible and intractable.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 manner; for example, about complements of complexity classes, search problems, and intermediate problems in NP*Provides 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 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 and practical learning tool. |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
accepting computation accepting configuration algorithm belongs to NP binary block Boolean c.e. set cells Church's thesis clean(k co-NP complete for NP complete sets complexity classes complexity theory computably enumerable computer science contains Corollary decidable set decision problem define definition denote deterministic Turing machine DLBA effectively presentable encoding equivalent example execution exists function f Gödel number graph G halt without accepting Halting problem Hamiltonian circuit Homework induction infinite input of length input string input word k-tape language Lemma linear speedup theorem machine that accepts many-one moves multitape multitape Turing machine natural numbers nondeterministic Turing machine NP-complete one-tape oracle Turing machine output partial computable function partial function polynomial hierarchy polynomial-time polynomial-time-bounded positive integer procedure proof of Theorem prove PSPACE query r₁ reducibility result satisfies scanned simulation space S(n space-bounded Turing machine subset Suppose transducer Turing-machine undecidable variables vertex cover
Beliebte Passagen
Seite 80 - A transducer T is a nondeterministic Turing machine with a read-only input tape, a write-only output tape, and accepting states in the usual manner. T computes a value y on an input string x if there is an accepting computation of T on x for which y is the final contents of T's output tape. Such transducers compute partial, multivalued functions.
Verweise auf dieses Buch
Complexity Theory: Exploring the Limits of Efficient Algorithms Ingo Wegener Keine Leseprobe verfügbar - 2005 |