scientific article

DOI10.4086/toc.2009.v005a013zbMath1213.68339OpenAlexW1606064697MaRDI QIDQ3002813

Dana Dachman-Soled, Andrew Wan, Tal Malkin, Homin K. Lee, Hoeteck Wee, Rocco A. Servedio

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2009.v005a013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational learning theorycryptographylower boundshardness amplificationanalysis of Boolean functions

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the nonlinearity of monotone Boolean functions

This page was built for publication: