Advertisement

Gems of Theoretical Computer Science

  • Uwe Schöning
  • Randall Pruim

Table of contents

  1. Front Matter
    Pages I-X
  2. Uwe Schöning, Randall Pruim
    Pages 1-8
  3. Uwe Schöning, Randall Pruim
    Pages 9-14
  4. Uwe Schöning, Randall Pruim
    Pages 15-23
  5. Uwe Schöning, Randall Pruim
    Pages 25-36
  6. Uwe Schöning, Randall Pruim
    Pages 37-40
  7. Uwe Schöning, Randall Pruim
    Pages 49-60
  8. Uwe Schöning, Randall Pruim
    Pages 61-70
  9. Uwe Schöning, Randall Pruim
    Pages 77-83
  10. Uwe Schöning, Randall Pruim
    Pages 85-90
  11. Uwe Schöning, Randall Pruim
    Pages 91-99
  12. Uwe Schöning, Randall Pruim
    Pages 101-109
  13. Uwe Schöning, Randall Pruim
    Pages 111-113
  14. Uwe Schöning, Randall Pruim
    Pages 115-122
  15. Uwe Schöning, Randall Pruim
    Pages 123-129
  16. Uwe Schöning, Randall Pruim
    Pages 131-139
  17. Uwe Schöning, Randall Pruim
    Pages 153-161
  18. Uwe Schöning, Randall Pruim
    Pages 163-174
  19. Uwe Schöning, Randall Pruim
    Pages 175-182
  20. Uwe Schöning, Randall Pruim
    Pages 183-189
  21. Uwe Schöning, Randall Pruim
    Pages 191-195
  22. Uwe Schöning, Randall Pruim
    Pages 197-202
  23. Uwe Schöning, Randall Pruim
    Pages 203-212
  24. Uwe Schöning, Randall Pruim
    Pages 213-222
  25. Uwe Schöning, Randall Pruim
    Pages 223-235
  26. Uwe Schöning, Randall Pruim
    Pages 237-308
  27. Back Matter
    Pages 309-320

About this book

Introduction

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.

Keywords

Kolmogorov complexity Resolution algorithms complexity complexity theory computability computer science logic theoretical computer science

Authors and affiliations

  • Uwe Schöning
    • 1
  • Randall Pruim
    • 2
  1. 1.Abt. Theoretische InformatikUniversität UlmUlmGermany
  2. 2.Dept. of Mathematics and StatisticsCalvin CollegeGrand RapidsUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-60322-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-64352-1
  • Online ISBN 978-3-642-60322-8
  • Buy this book on publisher's site
Industry Sectors
Health & Hospitals
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Aerospace