↓ Skip to main content

Gems of Theoretical Computer Science

Overview of attention for book
Cover of 'Gems of Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Fundamental Definitions and Results
  3. Altmetric Badge
    Chapter 2 The Priority Method
  4. Altmetric Badge
    Chapter 3 Hilbert’s Tenth Problem
  5. Altmetric Badge
    Chapter 4 The Equivalence Problem for LOOP(1)- and LOOP(2)-Programs
  6. Altmetric Badge
    Chapter 5 The Second LBA Problem
  7. Altmetric Badge
    Chapter 6 LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences
  8. Altmetric Badge
    Chapter 7 Exponential Lower Bounds for the Length of Resolution Proofs
  9. Altmetric Badge
    Chapter 8 Spectral Problems and Descriptive Complexity Theory
  10. Altmetric Badge
    Chapter 9 Kolmogorov Complexity, the Universal Distribution, and Worst-Case vs. Average-Case
  11. Altmetric Badge
    Chapter 10 Lower Bounds via Kolmogorov Complexity
  12. Altmetric Badge
    Chapter 11 PAC-Learning and Occam’s Razor
  13. Altmetric Badge
    Chapter 12 Lower Bounds for the Parity Function
  14. Altmetric Badge
    Chapter 13 The Parity Function Again
  15. Altmetric Badge
    Chapter 14 The Complexity of Craig Interpolants
  16. Altmetric Badge
    Chapter 15 Equivalence Problems and Lower Bounds for Branching Programs
  17. Altmetric Badge
    Chapter 16 The Berman-Hartmanis Conjecture and Sparse Sets
  18. Altmetric Badge
    Chapter 17 Collapsing Hierarchies
  19. Altmetric Badge
    Chapter 18 Probabilistic Algorithms, Probability Amplification, and the Recycling of Random Numbers
  20. Altmetric Badge
    Chapter 19 The BP Operator and Graph Isomorphism
  21. Altmetric Badge
    Chapter 20 The BP-Operator and the Power of Counting Classes
  22. Altmetric Badge
    Chapter 21 Interactive Proofs and Zero Knowledge
  23. Altmetric Badge
    Chapter 22 IP = PSPACE
  24. Altmetric Badge
    Chapter 23 P ≠ NP with probability 1
  25. Altmetric Badge
    Chapter 24 Superconcentrators and the Marriage Theorem
  26. Altmetric Badge
    Chapter 25 The Pebble Game
  27. Altmetric Badge
    Chapter 26 Average-Case Complexity
  28. Altmetric Badge
    Chapter 27 Quantum Search Algorithms
  29. Altmetric Badge
    Chapter 28 Solutions
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
21 Dimensions

Readers on

mendeley
3 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Gems of Theoretical Computer Science
Published by
Springer Berlin Heidelberg, December 2012
DOI 10.1007/978-3-642-60322-8
ISBNs
978-3-64-264352-1, 978-3-64-260322-8
Authors

Schöning, Uwe, Pruim, Randall

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Unspecified 2 67%
Student > Ph. D. Student 1 33%
Readers by discipline Count As %
Unspecified 2 67%
Computer Science 1 33%