论文标题
三维匹配是NP-HARD
Three-dimensional matching is NP-Hard
论文作者
论文摘要
3DM的NP硬度标准证明提供了功率 - $ 4 $减少3SAT至3DM。在本说明中，我们提供线性时间降低。在指数时间假设下，此减少将运行时的下限从$ 2^{o（\ sqrt [4] {m}）} $（在标准还原下）到$ 2^{o（m）} $。
The standard proof of NP-Hardness of 3DM provides a power-$4$ reduction of 3SAT to 3DM. In this note, we provide a linear-time reduction. Under the exponential time hypothesis, this reduction improves the runtime lower bound from $2^{o(\sqrt[4]{m})}$ (under the standard reduction) to $2^{o(m)}$.
