Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee. Optimal Cryptographic Hardness of Learning Monotone Functions. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz, editors, Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Volume 5125 of Lecture Notes in Computer Science, pages 36-47, Springer, 2008. [doi]
@inproceedings{Dachman-SoledLMSWW08,
title = {Optimal Cryptographic Hardness of Learning Monotone Functions},
author = {Dana Dachman-Soled and Homin K. Lee and Tal Malkin and Rocco A. Servedio and Andrew Wan and Hoeteck Wee},
year = {2008},
doi = {10.1007/978-3-540-70575-8_4},
url = {http://dx.doi.org/10.1007/978-3-540-70575-8_4},
researchr = {https://researchr.org/publication/Dachman-SoledLMSWW08},
cites = {0},
citedby = {0},
pages = {36-47},
booktitle = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games},
editor = {Luca Aceto and Ivan Damgård and Leslie Ann Goldberg and Magnús M. Halldórsson and Anna Ingólfsdóttir and Igor Walukiewicz},
volume = {5125},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-70574-1},
}