Paper Info
Title
A simple proof that AND-compression of NP-complete problems is hard.
Year
Venue
DocType
2014
Electronic Colloquium on Computational Complexity (ECCC)
Journal
Volume
Citations 
PageRank 
abs/1405.4472
3
0.39
References 
Authors
7
1
Name
Order
Citations
PageRank
Holger Dell122016.74