Distribution-free testing for monomials with a sublinear number of queries
From MaRDI portal
Publication:2913798
DOI10.4086/TOC.2011.V007A011zbMATH Open1247.68111OpenAlexW2186390088MaRDI QIDQ2913798FDOQ2913798
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2011.v007a011
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
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25)
Cited In (7)
- Almost optimal distribution-free junta testing
- Testing graphs against an unknown distribution
- On one-sided testing affine subspaces
- Distribution-free tests of subhypotheses
- On one-sided testing affine subspaces
- Which Distribution Distances are Sublinearly Testable?
- Almost Optimal Testers for Concise Representations.
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)
