一元运算
编码(内存)
二进制数
分辨率(逻辑)
计算机科学
整数规划
数学
理论计算机科学
算法
离散数学
算术
程序设计语言
人工智能
作者
Stefan Dantchev,Nicola Galesi,Abdul Ghani,Barnaby Martin
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI