Skip to main content
SpringerLink
Log in

Gems of Theoretical Computer Science

  • Book
  • © 1998

Overview

Authors:
  1. Uwe Schöning

    1. Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Randall Pruim

    1. Dept. of Mathematics and Statistics, Calvin College, Grand Rapids, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Compilation of the most glorious episodes from the annals of theoretical computer science * Over 240 fascinating exercises with elegant solutions on the centrals themes of theoretical computer science

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 chapters)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Fundamental Definitions and Results

    • Uwe Schöning, Randall Pruim
    Pages 1-8

  3. The Priority Method

    • Uwe Schöning, Randall Pruim
    Pages 9-14

  4. Hilbert’s Tenth Problem

    • Uwe Schöning, Randall Pruim
    Pages 15-23

  5. The Equivalence Problem for LOOP(1)- and LOOP(2)-Programs

    • Uwe Schöning, Randall Pruim
    Pages 25-36

  6. The Second LBA Problem

    • Uwe Schöning, Randall Pruim
    Pages 37-40

  7. LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences

    • Uwe Schöning, Randall Pruim
    Pages 41-47

  8. Exponential Lower Bounds for the Length of Resolution Proofs

    • Uwe Schöning, Randall Pruim
    Pages 49-60

  9. Spectral Problems and Descriptive Complexity Theory

    • Uwe Schöning, Randall Pruim
    Pages 61-70

  10. Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case

    • Uwe Schöning, Randall Pruim
    Pages 71-76

  11. Lower Bounds via Kolmogorov Complexity

    • Uwe Schöning, Randall Pruim
    Pages 77-83

  12. PAC-Learning and Occam’s Razor

    • Uwe Schöning, Randall Pruim
    Pages 85-90

  13. Lower Bounds for the Parity Function

    • Uwe Schöning, Randall Pruim
    Pages 91-99

  14. The Parity Function Again

    • Uwe Schöning, Randall Pruim
    Pages 101-109

  15. The Complexity of Craig Interpolants

    • Uwe Schöning, Randall Pruim
    Pages 111-113

  16. Equivalence Problems and Lower Bounds for Branching Programs

    • Uwe Schöning, Randall Pruim
    Pages 115-122

  17. The Berman-Hartmanis Conjecture and Sparse Sets

    • Uwe Schöning, Randall Pruim
    Pages 123-129

  18. Collapsing Hierarchies

    • Uwe Schöning, Randall Pruim
    Pages 131-139

  19. Probabilistic Algorithms, Probability Amplification, and the Recycling of Random Numbers

    • Uwe Schöning, Randall Pruim
    Pages 141-151

  20. The BP Operator and Graph Isomorphism

    • Uwe Schöning, Randall Pruim
    Pages 153-161
Back to top

Keywords

About this book

While I was visiting Boston University during the 1996-97 academic year, I noticed a small book, written in German, on a shelf in Steve Homer's office. Curious, I borrowed it for my train ride home and began reading one of the chapters. I liked the style and format of the book so much that over the course of the next few months I frequently found myself reaching for it and working through one chapter or another. This was my introduction to Peden der Theoretischen Informatik. A few of my colleagues had also seen the book. They also found it inter­ esting, but most of them did not read German well enough to read more than small portions of it enjoyably. I hope that the English version will rectify this situation, and that many will enjoy (and learn from) the English version as much as I enjoyed the German version. The front matter of this book says that it has been "translated, revised, and expanded." I should perhaps say a few words about each of these tasks. In translating the book, Ihave tried as much as possible to retain the feel of the original, which is somewhat less formal and impersonal than a typical text book yet relatively concise. I certainly hope that the "pleasure of the pursuit of understanding" has not gotten lost in the translation.

Authors and Affiliations

  • Abt. Theoretische Informatik, Universität Ulm, Ulm, Germany

    Uwe Schöning

  • Dept. of Mathematics and Statistics, Calvin College, Grand Rapids, USA

    Randall Pruim

Bibliographic Information

  • Book Title: Gems of Theoretical Computer Science

  • Authors: Uwe Schöning, Randall Pruim

  • DOI: https://doi.org/10.1007/978-3-642-60322-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1998

  • Softcover ISBN: 978-3-642-64352-1Published: 19 September 2011

  • eBook ISBN: 978-3-642-60322-8Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: X, 320

  • Additional Information: Original German edition published by Spektrum Akademischer Verlag, 1995

  • Topics: Data Structures and Information Theory, Theory of Computation

  • Industry Sectors: Electronics, IT & Software, Telecommunications

Publish with us

Policies and ethics

Back to top

Search

Navigation