Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee. Optimal Cryptographic Hardness of Learning Monotone Functions. Theory of Computing, 5(1):257-282, 2009. [doi]
@article{Dachman-SoledLMSWW09,
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 = {2009},
doi = {10.4086/toc.2009.v005a013},
url = {http://dx.doi.org/10.4086/toc.2009.v005a013},
researchr = {https://researchr.org/publication/Dachman-SoledLMSWW09},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {5},
number = {1},
pages = {257-282},
}