Request file

Review/Citation:  PICH, Ján, SANTHANAMZ, R. Why are proof complexity lower bounds hard? In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019). Los Alamitos: IEEE, 2019, s. 1305-1324. Annual IEEE Symposium on Foundations of Computer Science. ISBN 978-1-7281-4952-3. ISSN 0272-5428
Requested document:  Pich.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.