April: The Exponential Time Hypothesis (How hard is k-SAT?)

This time, our paper is strictly on the theory side of CS. The Exponential Time Hypothesis is basically the deluxe version of the common assumption that P!=NP. If you don't have the time or energy to make it through the paper (which is short, but mathy) don't be afraid, I (Lisa) already read this in the course of my studies and can present the content and answer your questions.

Get the paper here: On the Complexity of k-SAT
Also interesting: The followup paper Which Problems Have Strongly Exponential Complexity?

Note: The location is tentative, we may move to a pub nearby.