%0 Conference Paper %1 conf/fsttcs/Naor03 %A Naor, Moni %B FSTTCS %D 2003 %E Pandya, Paritosh K. %E Radhakrishnan, Jaikumar %I Springer %K dblp %P 434-442 %T Moderately Hard Functions: From Complexity to Spam Fighting. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#Naor03 %V 2914 %@ 3-540-20680-9

@inproceedings{conf/fsttcs/Naor03, added-at = {2017-05-24T00:00:00.000+0200}, author = {Naor, Moni}, biburl = {https://www.bibsonomy.org/bibtex/214d9112e2ffe525afb17622805d06e1e/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2003}, editor = {Pandya, Paritosh K. and Radhakrishnan, Jaikumar}, ee = {https://doi.org/10.1007/978-3-540-24597-1_37}, interhash = {807ff41446343d258afeffbb7a412914}, intrahash = {14d9112e2ffe525afb17622805d06e1e}, isbn = {3-540-20680-9}, keywords = {dblp}, pages = {434-442}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:08:53.000+0200}, title = {Moderately Hard Functions: From Complexity to Spam Fighting.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2003.html#Naor03}, volume = 2914, year = 2003 }