Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee
Optimal Cryptographic Hardness of Learning Monotone Functions
ICALP, 2008.
@inproceedings{ICALP-A-2008-Dachman-SoledLMSWW,
author = "Dana Dachman-Soled and Homin K. Lee and Tal Malkin and Rocco A. Servedio and Andrew Wan and Hoeteck Wee",
booktitle = "{Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Track A: Algorithms, Automata, Complexity, and Games}",
doi = "10.1007/978-3-540-70575-8_4",
isbn = "978-3-540-70574-1",
pages = "36--47",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Optimal Cryptographic Hardness of Learning Monotone Functions}",
volume = 5125,
year = 2008,
}
Tags: