Distribution-free testing algorithms for monomials with a sublinear number of queries

DOI10.1007/978-3-642-15369-3_40MaRDI QIDQ3588432zbMATH OpenOpenAlexFDO

Authors Elya Dolev, Dana Ron

Publication date 10 September 2010

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15369-3_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Distribution-free testing for monomials with a sublinear number of queries
• Distribution-Free Property-Testing
• Distribution-free property testing
• Tight bounds for the distribution-free testing of monotone conjunctions
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Cited in

(4)

• Tight bounds for the distribution-free testing of monotone conjunctions
• Distribution-free property testing
• Distribution-free testing for monomials with a sublinear number of queries
• Which Distribution Distances are Sublinearly Testable?

This page was built for publication: Distribution-free testing algorithms 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 Q3588432)