Fast learning requires good memory: a time-space lower bound for parity learning (Q4625669)
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 7029233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast learning requires good memory: a time-space lower bound for parity learning |
scientific article; zbMATH DE number 7029233 |
Statements
Fast Learning Requires Good Memory (English)
0 references
25 February 2019
0 references
lower bounds
0 references
bounded-storage cryptography
0 references
branching program
0 references
learning
0 references
time-space tradeoff
0 references
0.8810611367225647
0 references
0.7841287851333618
0 references
0.7603674530982971
0 references
0.7478510141372681
0 references
0.742664098739624
0 references
