arXiv - CS - Computational Complexity Pub Date : 2020-02-29 , DOI: arxiv-2003.00336
Shrinu Kushagra

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)}$.

down
wechat
bug