2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

Fix a prime $p$ and a positive integer $R$. We study the property testing of functions $\mathbb{F}_{p}^{n}\rightarrow[R]$. We say that a property is testable if there exists an oblivious tester for this property with one-sided error and constant query complexity. Furthermore, a property is proximity oblivious-testable (PO-testable) if the test is also independent of the proximity parameter $\epsilon$. It is known that a number of natural properties such as linearity and being a low degree… Expand