Pages that link to "Item:Q3575150"
From MaRDI portal
The following pages link to Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem (Q3575150):
Displayed 18 items.
- Bounds from a card trick (Q414410) (← links)
- The power and limitations of uniform samples in testing properties of figures (Q666678) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Chebyshev polynomials, moment matching, and optimal estimation of the unseen (Q1731061) (← links)
- Sample complexity of the distinct elements problem (Q1737973) (← links)
- Sublinear algorithms for approximating string compressibility (Q2392931) (← links)
- Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
- An Automatic Inequality Prover and Instance Optimal Identity Testing (Q2968159) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- Invariance in Property Testing (Q4933370) (← links)
- Testing Monotone Continuous Distributions on High-Dimensional Real Cubes (Q4933371) (← links)
- Recovering Structured Probability Matrices (Q4993314) (← links)
- Proofs of Proximity for Distribution Testing (Q4993323) (← links)
- Testing Probability Distributions using Conditional Samples (Q5255008) (← links)
- Testing convexity of figures under the uniform distribution (Q5381051) (← links)
- On Approximating the Number of Relevant Variables in a Function (Q5894227) (← links)
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality (Q6062150) (← links)
- A lower bound on the complexity of testing grained distributions (Q6063025) (← links)