Theory Seminar: Dr. Igor C. Olivera, "Meta-Mathematics of P vs NP."
Dec 1, 2025 10:00 - 11:00 am
- Sponsor
- Theory and Algorithms Research Area
- Speaker
- Dr. Igor C. Olivera
- Contact
- Allison Mette
- agk@illinois.edu
- Views
- 57
- Originating Calendar
- Siebel School Speakers Calendar
- Abstract: We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity bounds within theories of bounded arithmetic. This includes the techniques employed and related open problems, such as the (non)existence of a feasible proof that P = NP.
Bio: Dr. Igor Carboni Oliveira is an Associate Professor in the Department of Computer Science at the University of Warwick, UK. Dr. Carboni Oliveira is a member of the Division of Theory and Foundations (FoCS) and of the Centre fro Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. His research interests are in computational complexity theory and its connections to algorithms, combinatorics, and mathematical logic.