论文标题
证明复杂性和组合原理的二进制编码
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.
