Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan. Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem. Electronic Colloquium on Computational Complexity (ECCC), 21:146, 2014. [doi]
@article{BonacinaGHW14,
title = {Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem},
author = {Ilario Bonacina and Nicola Galesi and Tony Huynh and Paul Wollan},
year = {2014},
url = {http://eccc.hpi-web.de/report/2014/146},
researchr = {https://researchr.org/publication/BonacinaGHW14},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {21},
pages = {146},
}