Two weeks ago the world of theoretical computer science was in uproar when OpenAI announced a proof that the Exponential Time Hypothesis (ETH) is false. Since then experts have been scrambling to understand and digest the proof.

On November 11, we’re excited to invite you to a timely discussion with Matthias Lanzinger, from the Research Unit Databases and Artificial Intelligence, who will give a talk on the proof and the underlying algorithm.

Abstract: We will present an algorithm that solves 3-SAT and related hard combinatorial problems in subexponential time. Thus, refuting the long-standing Exponential Time Hypothesis.

Can’t make it in person? Watch the talk via live stream!

Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.