Gems of Theoretical Computer Science
Seiten
1998
Springer Berlin (Hersteller)
978-3-540-64425-5 (ISBN)
Springer Berlin (Hersteller)
978-3-540-64425-5 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
This book introduces some of the most important results in theoretical computer science. The gems are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and much, much more. With over 240 intriguing exercises (elegant solutions for which are supplied), the text also challenges the reader to do some active work.
Autorenporträt:
Prof. Dr. Uwe Schöning ist Leiter der Abteilung Theoretische Informatik der Universität Ulm.
An introduction to important results in theoretical computer science. The 'gems' are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and more. There are over 240 exercises.
Autorenporträt:
Prof. Dr. Uwe Schöning ist Leiter der Abteilung Theoretische Informatik der Universität Ulm.
An introduction to important results in theoretical computer science. The 'gems' are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and more. There are over 240 exercises.
Prof. Dr. Uwe Schöning ist Leiter der Abteilung Theoretische Informatik der Universität Ulm.
Collaborating Hierarchies.- Equivalence of Branching Programs.- Craig Interpolants.- Probability Amplification.- Interactive Proof Systems.- Zero Knowledge.- Graph Isomorphism.- Superconcentrations.- Pebble Game.
| Übersetzer | R. Pruim |
|---|---|
| Sprache | englisch |
| Gewicht | 618 g |
| Einbandart | gebunden |
| Schlagworte | Informatik |
| ISBN-10 | 3-540-64425-3 / 3540644253 |
| ISBN-13 | 978-3-540-64425-5 / 9783540644255 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
