Optimal cryptographic hardness of learning monotone functions (Q3002813)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5899286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal cryptographic hardness of learning monotone functions |
scientific article; zbMATH DE number 5899286 |
Statements
24 May 2011
0 references
computational learning theory
0 references
hardness amplification
0 references
lower bounds
0 references
cryptography
0 references
analysis of Boolean functions
0 references
0.9878228902816772
0 references
0.8140909075737
0 references
0.8084896802902222
0 references
0.8042024970054626
0 references
0.8018874526023865
0 references
