1. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47(3), 549–595 (1993)
2. Bshouty, N.H.: Almost optimal testers for concise representations. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, 17–19 August 2020, Virtual Conference, pp. 5:1–5:20 (2020)
3. Bshouty, N.H., Goldreich, O.: On properties that are non-trivial to test. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 13 (2022)
4. Lecture Notes in Computer Science;S Chakraborty,2011
5. Chen, X., Xie, J.: Tight bounds for the distribution-free testing of monotone conjunctions. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10–12 January 2016, pp. 54–71 (2016)