Lemma

Notes on Theoretical Computer Science and Mathematics.

Lemma is an evolving collection of notes on theoretical computer science and mathematics, emphasizing clarity and intuition. The notes are typically concise and updated weekly, each focusing on a single idea. Suggestions and corrections are welcome.

  1. Bernoulli Factories [Tags: Probability, Algorithms]
  2. White Noise vs Data [Tags: Distribution Testing]
  3. Gaussian Binomial [Tags: Discrete Maths, Combinatorics]
  4. Algebraic Complexity Classes [Tags: Algbraic Complexity Theory]
  5. Determinant and Permanent [Tags: Algbraic Complexity Theory]
  6. Expander Graphs [Tags: Data Structures, Randomized Algorithms]
  7. Concentration Inequalities [Tags: Probability]
  8. Hashing [Tags: Data Structures, Randomized Algorithms]
  9. Randomized Complexity Classes [Tags: Complexity Theory]