Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ilario Bonacina' in GoogleThis author has not been identified. Look up 'Nicola Galesi' in GoogleThis author has not been identified. Look up 'Tony Huynh' in GoogleThis author has not been identified. Look up 'Paul Wollan' in Google

runs on WebDSL