New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries |
scientific article |
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
