论 SAT 信息内容、其多项式时间可解性与固定代码算法
On SAT information content, its polynomial-time solvability and fixed code algorithms
AI总结:
本文研究了可满足性问题(SAT)的信息量,证明当算法持有指数级信息时SAT可多项式时间求解,SAT的Kolmogorov复杂度为常数,且其信息量随输入规模至少呈指数级增长。
摘要:
本文研究了可满足性问题(SAT)中的信息量。当求解算法持有指数级信息量时,SAT 可在多项式时间内求解。研究还确立了 SAT 的 Kolmogorov 复杂度为常数。论证表明,SAT 中的信息量随输入实例规模至少呈指数级增长。本文将 SAT 中的信息量与固定代码算法中及运行时生成的信息量进行了比较。
英文摘要:
The amount of information in satisfiability problem (SAT) is considered. SAT can be polynomial-time solvable when the solving algorithm holds an exponential amount of information. It is also established that SAT Kolmogorov complexity is constant. It is argued that the amount of information in SAT grows at least exponentially with the size of the input instance. The amount of information in SAT is compared with the amount of information in the fixed code algorithms and generated over runtime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。