Publisher
Springer Berlin Heidelberg
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A strong composition theorem for junta complexity and the boosting of property testers;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Testing noisy linear functions for sparsity;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
3. Group Testing: An Information
Theory Perspective;Foundations and Trends® in Communications and Information Theory;2019
4. Non-interactive proofs of proximity;computational complexity;2016-06-03
5. Testing Juntas and Related Properties of Boolean Functions;Encyclopedia of Algorithms;2016