"Optimal Cryptographic Hardness of Learning Monotone Functions."

Dana Dachman-Soled et al. (2009)

> Home

Details and statistics

DOI: 10.4086/TOC.2009.V005A013

access: open

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/Dachman-SoledLMSWW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/Dachman-SoledLMSWW09
Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. Theory Comput. 5(1): 257-282 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.