Three-dimensional matching is NP-Hard
Computational Complexity
2020-03-03 v1
Abstract
The standard proof of NP-Hardness of 3DM provides a power- 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 (under the standard reduction) to .
Cite
@article{arxiv.2003.00336,
title = {Three-dimensional matching is NP-Hard},
author = {Shrinu Kushagra},
journal= {arXiv preprint arXiv:2003.00336},
year = {2020}
}