New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries |
scientific article; zbMATH DE number 7433302
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries |
scientific article; zbMATH DE number 7433302 |
Statements
New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (English)
0 references
25 November 2021
0 references
computational learning theory
0 references
Boolean function learning
0 references
intersections of halfspaces
0 references
cryptography
0 references
differing-inputs obfuscation
0 references
0 references
0 references
0 references
0 references
