New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q615244 |
Changed an Item |
||
| Property / author | |||
| Property / author: Da-Wu Gu / rank | |||
Normal rank | |||
Revision as of 01:32, 20 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
