Nearly Optimal NP-Hardness of Unique Coverage

Venkatesan Guruswami, Euiwoong Lee. Nearly Optimal NP-Hardness of Unique Coverage. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 1724-1730, SIAM, 2016. [doi]

Abstract

Abstract is missing.