Pages that link to "Item:Q5700573"
From MaRDI portal
The following pages link to The Complexity of Approximating the Entropy (Q5700573):
Displayed 14 items.
- Coincidences and estimation of entropies of random variables with large cardinalities (Q400965) (← links)
- Bounds from a card trick (Q414410) (← links)
- Is submodularity testable? (Q472463) (← links)
- A sublinear-time approximation scheme for bin packing (Q1034628) (← links)
- Testing shape restrictions of discrete distributions (Q1702847) (← links)
- Quantum spectrum testing (Q2231675) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- An Automatic Inequality Prover and Instance Optimal Identity Testing (Q2968159) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- A simple method for estimating the entropy of neural activity (Q3301563) (← links)
- Sampling Correctors (Q4577769) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- Testing Probability Distributions using Conditional Samples (Q5255008) (← links)