Pages that link to "Item:Q5205791"
From MaRDI portal
The following pages link to Distribution Testing Lower Bounds via Reductions from Communication Complexity (Q5205791):
Displaying 9 items.
- Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP (Q2043015) (← links)
- Minimax optimal conditional independence testing (Q2054483) (← links)
- Sharp local minimax rates for goodness-of-fit testing in multivariate binomial and Poisson families and in multinomials (Q2102432) (← links)
- Distribution-free testing for monomials with a sublinear number of queries (Q2913798) (← links)
- Which Distribution Distances are Sublinearly Testable? (Q4608070) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Topics and Techniques in Distribution Testing: A Biased but Representative Sample (Q5870774) (← links)
- Testing Data Binnings (Q6062145) (← links)
- Sparse signal detection in heteroscedastic Gaussian sequence models: sharp minimax rates (Q6565316) (← links)
