PPT-Unprovability of strong complexity lower bounds in bounded arithmetic PowerPoint Presentation

Dagstuhl Workshop March 2023 Igor Carboni Oliveira University of Warwick 1 Join work with Jiatu Li Tsinghua 2 Context Goals of Complexity Theory include separating

Upload by eve
Published on 2024-01-03

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/1037150" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "Unprovability of strong complexity lower..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.