Optimal Cryptographic Hardness of Learning Monotone Functions - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Dana Dachman-Soled' in GoogleThis author has not been identified. Look up 'Homin K. Lee' in GoogleThis author has not been identified. Look up 'Tal Malkin' in GoogleThis author has not been identified. Look up 'Rocco A. Servedio' in GoogleThis author has not been identified. Look up 'Andrew Wan' in GoogleThis author has not been identified. Look up 'Hoeteck Wee' in Google

runs on WebDSL