Short Propositional Refutations for Dense Random 3CNF Formulas

DOI10.1109/LICS.2012.60zbMath1364.03082OpenAlexW2095069707MaRDI QIDQ2986826

No author found.

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.60

zbMATH Keywords

proof complexityFrege proofsthreshold logicrandom 3-SATrefutation algorithms

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items (1)

Short propositional refutations for dense random 3CNF formulas

This page was built for publication: Short Propositional Refutations for Dense Random 3CNF Formulas