Proof complexity and the binary encoding of combinatorial principles
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
