New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114848479, #quickstatements; #temporary_batch_1723453003539 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ic.2021.104771 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IC.2021.104771 / rank | |||
Normal rank | |||
Latest revision as of 22:43, 16 December 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
0 references
0 references
0 references
0 references
