Computability and Complexity Theory
Seiten
2001
|
and ed.
Springer-Verlag New York Inc.
978-0-387-95055-6 (ISBN)
Springer-Verlag New York Inc.
978-0-387-95055-6 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Suitable for use in an introductory graduate course in theoretical computer science, this title contains material that should be core knowledge in the theory of computation for various graduates in computer science. It starts with computability theory which forms the basis for complexity theory.
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.
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.
1. Preliminaries; 2. Introduction to Computability; 3. Undecidability; 4. Introduction to Complexity Theory; 5. Basic Results; 6. Nondeterminism and NP-Completeness; 7. Relative Computability
| Erscheint lt. Verlag | 1.7.2001 |
|---|---|
| Reihe/Serie | Texts in Computer Science |
| Zusatzinfo | 40 black & white illustrations |
| Verlagsort | New York, NY |
| Sprache | englisch |
| Maße | 178 x 235 mm |
| Gewicht | 1410 g |
| Einbandart | gebunden |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| ISBN-10 | 0-387-95055-9 / 0387950559 |
| ISBN-13 | 978-0-387-95055-6 / 9780387950556 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Hardcover (2012)
Westermann Schulbuchverlag
CHF 44,90
Schulbuch Klassen 7/8 (G9)
Buch | Hardcover (2015)
Klett (Verlag)
CHF 29,90
Buch | Softcover (2004)
Cornelsen Verlag
CHF 23,90
