Tag Archives: theoretical computer science

About the Cardinality of Sets

Even though it “only” was an assignment in Computational Models, it has a rather nice solution. The Problem:
Show that for every set it holds that .
A proof: The basic idea is to generalize Cantor’s diagonal argument. Assume that there is a set such that . Then there is a surjective mapping . Define [...]

The Blog’s Future

Even if it was rather quiet on my blog over the last few months, I had a really exciting time. Let’s dive quickly into a brief overview what’s happened:

We, my girlfriend and I, renewed our relationship. Quite exciting since I never thought we would be back together again and that our bond could be much [...]

Concrete Complexity: Theorem Mindmap and Summary

Since my oral exam in concrete complexity theory is coming up very soon I’ve prepared a mindmap, showing the most important theorems and how they are connected. I will add the link very soon; An update in this post will you inform if the mindmap is on Furthermore I’m currently writing a summary, [...]

A lower bound for 3-Clique

We will (recap the) proof of

Share/Save