On the Compressibility of NP Instances and Cryptographic Applications.

Danny Harnik Moni Naor

Published in: Electron. Colloquium Comput. Complex. (2006)

Keyphrases

computational complexity
smart card
randomly generated
np complete
hash functions
test instances
data mining
learning algorithm
objective function
linear programming
lower and upper bounds