On one-sided testing affine subspaces

DOI10.1007/978-3-031-30448-4_12MaRDI QIDQ6057325zbMATH OpenFDO

Authors Nader H. Bshouty

Publication date 4 October 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30448-4_12

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic and analysis techniques in property testing
• Almost Optimal Testers for Concise Representations.
• An improved zig zag approach for competitive group testing
• Distribution-free testing for monomials with a sublinear number of queries
• Distribution-free testing lower bound for basic Boolean functions
• Efficient sample extractors for juntas with applications
• Introduction to Property Testing
• Property testing. A learning theory perspective
• Property testing. Current research and surveys
• Reducing Testing Affine Spaces to Testing Linearity of Functions
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• Testing Basic Boolean Formulae
• Tight bounds for the distribution-free testing of monotone conjunctions

This page was built for publication: On one-sided testing affine subspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057325)