Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Previous
Next
Table of Contents
Similar Articles
Home
Proceedings
FOCS
FOCS 2019
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
Why are Proof Complexity Lower Bounds Hard?
Year: 2019, Pages: 1305-1324
DOI Bookmark:
10.1109/FOCS.2019.00080
Authors
Jan Pich
,
University of Oxford
Rahul Santhanam
,
University of Oxford
Download PDF
SHARE ARTICLE
Generate Citation
Abstract
