PPT-Unprovability of strong complexity lower bounds in bounded arithmetic
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
Download Presentation
"Unprovability of strong complexity lower bounds in bounded a " is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement. Download
Presentation Transcript
Transcript not available.