BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IMPAN//Mathematics and AI//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Mathematics and AI
X-WR-TIMEZONE:Europe/Warsaw
BEGIN:VEVENT
UID:2026-11-19@mathandai.impan.pl
DTSTAMP:20261109T124644Z
DTSTART:20261119T131500Z
DTEND:20261119T141500Z
SUMMARY:Mathematics and AI: Łukasz Kowalik – AI tells us that Exponentia
 l Time Hypothesis is false
LOCATION:IMPAN\, ul. Śniadeckich 8\, Warsaw\, room 321
DESCRIPTION:Łukasz Kowalik (Faculty of Mathematics\, Informatics and Mecha
 nics\, University of Warsaw)\nOpenAI and Anthropic recently announced that
  their AI models disproved the Exponential Time Hypothesis (ETH)\, which (
 if confirmed) would be a major breakthrough in complexity theory. ETH stat
 es (roughly) that 3-SAT cannot be solved in subexponential time\, i.e. tim
 e 2^o(n)\, so it is much stronger than the P ≠ NP statement. During th
 e talk I will introduce ETH\, its variant Strong ETH and their role in the
  area called Fine Grained Complexity. Next I will try to discuss what the 
 fact that ETH is false means for this area. I will also briefly sketch the
  proof approach taken by OpenAI\, based on the exposition given by Ryan O'
 Donnell.\nhttps://mathandai.impan.pl/#2026-11-19
URL:https://mathandai.impan.pl/#2026-11-19
END:VEVENT
END:VCALENDAR