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 the normal view instead:
scientific article; zbMATH DE number 7433302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8572021126747131
0 references
0.7917042970657349
0 references
0.7789685726165771
0 references
0.7740499973297119
0 references
0.7680948972702026
0 references
