Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Abstract is missing.