Monthly Archives: November 2013

One interesting thing: Average polynomial time algorithms


The most celebrated problem in theoretical computer science is undoubtedly the P vs. NP problem. Let me explain what it is asking. (If you already know this, feel free to skip the next few paragraphs.) Suppose we have a general … Continue reading

Posted in Uncategorized | Leave a comment

One interesting thing: Erdős–Rényi random graphs


I’ve been thinking a lot about random graphs this week, so it is appropriate for my post this week to be about them. One of the most important models of random graphs is the Erdős–Rényi model. Here is the construction: we … Continue reading

Posted in Uncategorized | 1 Comment

One Interesting Thing: The preponderance of 2-groups among finite groups


This is a preliminary discussion of my knowledge about 2-groups. There are still many questions I have, and I would appreciate any insights. When we first learn about group theory, we learn some theorems about how to decompose finite groups, … Continue reading

Posted in Uncategorized | Leave a comment

One Interesting Thing: Homomorphic Encryption


I plan to start writing about one interesting thing I learn each week. This will serve two purposes: forcing me to think about interesting things, and also forcing me to write. Here is the first installment in the series. Suppose … Continue reading

Posted in Uncategorized | Leave a comment