当输入整数以一元记数法给出时
When Input Integers are Given in the Unary Numeral Representation
AI总结:
本文研究输入整数从二进制改为一元表示对组合问题复杂度的影响,列举多个因此变得易解的NP完全/NP难问题,以揭示强与非强NP完全性的结构差异。
摘要:
许多NP完全问题将整数作为其输入实例的一部分。这些输入整数通常被二进制化,即以“二进制”记数表示形式提供,而这种二进制形式的长度被用作衡量问题计算复杂度的基本单位。与之形成鲜明对比的是,数字的“一元化”(或称“一元”记数表示)已知会对问题的计算复杂度产生显著不同的影响。相反,当实例的二进制化与一元化之间未观察到计算复杂度差异时,这些问题被称为强NP完全问题。本工作试图聚焦于一个问题:实例的一元化如何影响各类组合问题的计算复杂度。我们给出了许多NP完全(甚至NP难)问题,结果表明当输入整数以一元形式表示时,这些问题可以被轻松求解。随后,我们讨论了此类问题在接收一元形式整数输入时的计算复杂度。我们希望这样的问题清单能够彰显强NP完全性与非强NP完全性之间的结构性差异。
英文摘要:
Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral representation, and the lengths of such binary forms are used as a basis unit to measure the computational complexity of the problems. In sharp contrast, the "unarization" (or the "unary" numeral representation) of numbers has been known to bring a remarkably different effect onto the computational complexity of the problems. When no computational-complexity difference is observed between binarization and unarization of instances, on the contrary, the problems are said to be strong NP-complete. This work attempts to spotlight an issue of how the unarization of instances affects the computational complexity of various combinatorial problems. We present numerous NP-complete (or even NP-hard) problems, which turn out to be easily solvable when input integers are represented in unary. We then discuss the computational complexities of such problems when taking unary-form integer inputs. We hope that a list of such problems signifies the structural differences between strong NP-completeness and non-strong NP-completeness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。