ACM Symposium on Discrete Algorithms, SODA 2016


Article Details
Title: Nearly Optimal NP-Hardness of Unique Coverage
Article URLs:
Alternative Article URLs:
Authors: Venkatesan Guruswami
  • Carnegie Mellon University
Euiwoong Lee
  • Carnegie Mellon University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1115525
DBLP Key: conf/soda/GuruswamiL16
Author Comments:

Discuss this paper and its artifacts below