Pages that link to "Item:Q4625669"
From MaRDI portal
The following pages link to Fast Learning Requires Good Memory (Q4625669):
Displaying 8 items.
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- Secure multiparty computation in the bounded storage model (Q2149802) (← links)
- (Q4638056) (← links)
- Time-space hardness of learning sparse parities (Q4978047) (← links)
- Entropy samplers and strong generic lower bounds for space bounded learning (Q4993292) (← links)
- Improved learning of \(k\)-parities (Q5916259) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- Memory-sample lower bounds for LWE (Q6652965) (← links)