Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.

The documenta is not a museum, but a place of encounter and confrontation.

I'm still standing better than I ever did. Looking like a true survivor, feeling like a little kid.