@inbook{c6254e5f2f4340bcaebed22bb811a019,
title = "On Properties that are Non-trivial to Test",
abstract = "In this note we show that all sets that are neither finite nor too dense are non-trivial to test in the sense that, for every ϵ>0, distinguishing between strings in the set and strings that are ϵ-far from the set requires Ω(1/ϵ) queries. Specifically, we show that if, for infinitely many n{\textquoteright}s, the set contains at least one n-bit long string and at most 2n-Ω(n) many n-bit strings, then it is non-trivial to test.",
author = "Bshouty, \{Nader H.\} and Oded Goldreich",
note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.",
year = "2025",
doi = "10.1007/978-3-031-88946-2\_21",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "383--387",
booktitle = "Lecture Notes in Computer Science",
address = "ألمانيا",
}