Rahul Santhanam, Iddo Tzameret. Iterated lower bound formulas: a diagonalization-based approach to proof complexity. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 234-247, ACM, 2021. [doi]
@inproceedings{SanthanamT21,
title = {Iterated lower bound formulas: a diagonalization-based approach to proof complexity},
author = {Rahul Santhanam and Iddo Tzameret},
year = {2021},
doi = {10.1145/3406325.3451010},
url = {https://doi.org/10.1145/3406325.3451010},
researchr = {https://researchr.org/publication/SanthanamT21},
cites = {0},
citedby = {0},
pages = {234-247},
booktitle = {STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021},
editor = {Samir Khuller and Virginia Vassilevska Williams},
publisher = {ACM},
isbn = {978-1-4503-8053-9},
}