Distribution-free testing for monomials with a sublinear number of queries
From MaRDI portal
Publication:2913798
Recommendations
- Distribution-free testing algorithms for monomials with a sublinear number of queries
- Sublinear algorithms for testing monotone and unimodal distributions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Tight bounds for the distribution-free testing of monotone conjunctions
- Toward randomized testing of \(q\)-monomials in multivariate polynomials
- Distribution-free tests of subhypotheses
- Almost Optimal Distribution-Free Sample-Based Testing of k-Modality
- Distribution testing lower bounds via reductions from communication complexity
- Distribution testing lower bounds via reductions from communication complexity
- Almost optimal distribution-free junta testing
Cited in
(10)- Distribution-free tests of subhypotheses
- On one-sided testing affine subspaces
- Distribution-free property testing
- Almost Optimal Testers for Concise Representations.
- Distribution-free testing algorithms for monomials with a sublinear number of queries
- Almost optimal distribution-free junta testing
- On one-sided testing affine subspaces
- Which Distribution Distances are Sublinearly Testable?
- Tight bounds for the distribution-free testing of monotone conjunctions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Distribution-free testing for monomials with a sublinear number of queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913798)
