Space proof complexity for random 3-CNFs
From MaRDI portal
Publication:2013560
DOI10.1016/j.ic.2017.06.003zbMath1423.03242arXiv1503.01613WikidataQ61732560 ScholiaQ61732560MaRDI QIDQ2013560
Paul Wollan, Patrick Bennett, Tony Huynh, Ilario Bonacina, Mike Molloy, Nicola Galesi
Publication date: 8 August 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01613
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
03F20: Complexity of proofs