On the hardness of learning sparse parities (Q4606280)
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 6846382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of learning sparse parities |
scientific article; zbMATH DE number 6846382 |
Statements
2 March 2018
0 references
fixed parameter tractable
0 references
juntas
0 references
minimum distance of code
0 references
psuedorandom generators
0 references
On the hardness of learning sparse parities (English)
0 references
0.7906121611595154
0 references
0.7742664813995361
0 references
0.7433128356933594
0 references
0.735519289970398
0 references
