2 search results - page 1 / 1 » A new algorithm for testing if a regular language is locally... |
IPL
2007
13 years 4 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...