Proof complexity and the binary encoding of combinatorial principles
arXiv:2008.02138
Abstract
We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear Programming. Please consult the article for the full abstract.
arXiv commentarXiv admin note: substantial text overlap with arXiv:1809.02843, arXiv:1911.00403