Three-dimensional matching is NP-Hard
Reviewed by Pithpith:HTQHVTHUopen to challenge →
classification
cs.CC
keywords
reductionstandardunderboundexponentialhypothesisimproveslinear-time
read the original abstract
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)}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.