The following pages link to Compression of samplable sources (Q813316):
Displaying 8 items.
- The complexity of estimating min-entropy (Q260395) (← links)
- Comparing notions of computational entropy (Q733747) (← links)
- On optimal language compression for sets in PSPACE/poly (Q2354585) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- Sample Compression Schemes for VC Classes (Q3177793) (← links)
- Compression With Actions (Q5346093) (← links)
- Interactive compression for product distributions (Q5361896) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)