The 2023 Gödel Prize is awarded to Thomas Rothvoss for his paper "The matching polytope has exponential extension complexity." He shares this award with Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary and Ronald de Wolf for their paper "Exponential Lower Bounds for Polytopes in Combinatorial Optimization."
The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery (ACM SIGACT). This award is presented annually, with the presentation taking place alternately at the EATCS International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The thirty-first Gödel Prize will be awarded at the ACM Symposium on Theory of Computing (STOC), which will take place in Orlando, Florida, June 20-23, 2023.
The Prize is named in honor of Kurt Gödel in recognition of his major contributions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous “P versus NP” question.