An optimal tester for \(k\)-linear

DOI10.1007/978-3-030-96731-4_17OpenAlexW4226194630MaRDI QIDQ2154097

Nader H. Bshouty

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2006.04409

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Testing juntas
• Property testing lower bounds via communication complexity
• Self-testing/correcting with applications to numerical problems
• Property testing and its connection to learning and approximation
• Tight Bounds for Testing k-Linearity
• Sublinear Time Algorithms
• Distribution-Free Property-Testing
• Improved Bounds for Testing Juntas
• On Testing Computability by Small Width OBDDs
• Robust Characterizations of Polynomials with Applications to Program Testing
• A Brief Introduction to Property Testing
• Almost optimal distribution-free junta testing
• Testing juntas nearly optimally
• lgorithmic and Analysis Techniques in Property Testing
• Introduction to Property Testing

This page was built for publication: An optimal tester for \(k\)-linear