New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2021.104771 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3175971210 / rank | |||
Normal rank | |||
Revision as of 00:44, 20 March 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
