# Testing linear-invariant properties

@article{Tidor2020TestingLP,
title={Testing linear-invariant properties},
author={Jonathan Tidor and Y. Zhao},
journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)},
year={2020},
pages={1180-1190}
}
• Published 2020
• Computer Science, Mathematics
• 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
1 Citations

#### References

SHOWING 1-10 OF 43 REFERENCES
Self-testing/correcting with applications to numerical problems
• Computer Science, Mathematics
• STOC '90
• 1990
• 972
• Highly Influential
• PDF
Every locally characterized affine-invariant property is testable
• Mathematics, Computer Science
• STOC '13
• 2013
• 42
• Highly Influential
• PDF
Testing Low Complexity Affine-Invariant Properties
• Computer Science, Mathematics
• SODA
• 2013
• 24
• Highly Influential
• PDF
Triple systems with no six points carrying three triangles, Combinatorics (Proc
• Fifth Hungarian Colloq., Keszthely,
• 1976
A unified framework for testing linear-invariant properties
• Mathematics, Computer Science
• Random Struct. Algorithms
• 2015
• 16
• Highly Influential
AN INVERSE THEOREM FOR THE GOWERS U4-NORM
• Mathematics
• Glasgow Mathematical Journal
• 2010
• 154
• Highly Influential
• PDF
A characterization of the (natural) graph properties testable with one-sided error
• Mathematics, Computer Science
• 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
• 2005
• 189
• Highly Influential
• PDF