On the Compressibility of NP Instances and Cryptographic Applications

Danny Harnik, Moni Naor. On the Compressibility of NP Instances and Cryptographic Applications. Electronic Colloquium on Computational Complexity (ECCC), 13(022), 2006. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.