On the Compressibility of NP Instances and Cryptographic Applications Export

@inproceedings{citeulike:2821367, address = {Washington, DC, USA}, author = {Harnik, Danny and Naor, Moni}, booktitle = {FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science}, citeulike-article-id = {2821367}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1170136.1170476}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/FOCS.2006.54}, doi = {10.1109/FOCS.2006.54}, keywords = {complexity, compression}, pages = {719--728}, posted-at = {2008-05-21 22:12:24}, priority = {2}, publisher = {IEEE Computer Society}, title = {On the Compressibility of NP Instances and Cryptographic Applications}, url = {http://dx.doi.org/10.1109/FOCS.2006.54}, year = {2006} }

TY - CONF ID - citeulike:2821367 L3 - citeulike-article-id:2821367 AD - Washington, DC, USA EP - 728 TI - On the Compressibility of NP Instances and Cryptographic Applications PB - IEEE Computer Society T2 - FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science SP - 719 KW - complexity KW - compression AU - Harnik, Danny AU - Naor, Moni PY - 2006/// UR - http://dx.doi.org/10.1109/FOCS.2006.54 ER -