"Optimal Cryptographic Hardness of Learning Monotone Functions."

Dana Dachman-Soled et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-70575-8_4

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/Dachman-SoledLMSWW08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Dachman-SoledLMSWW08
Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee:
Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47

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.