Pages that link to "Item:Q4978047"
From MaRDI portal
The following pages link to Time-space hardness of learning sparse parities (Q4978047):
Displaying 11 items.
- Secure multiparty computation in the bounded storage model (Q2149802) (← links)
- Authentication in the bounded storage model (Q2170109) (← links)
- On the hardness of learning sparse parities (Q4606280) (← links)
- Fast Learning Requires Good Memory (Q4625669) (← links)
- Entropy samplers and strong generic lower bounds for space bounded learning (Q4993292) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Time-space lower bounds for two-pass learning (Q5091773) (← links)
- Improved learning of \(k\)-parities (Q5916259) (← links)
- (Q6062142) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- Memory-sample lower bounds for LWE (Q6652965) (← links)