@inbook{3ba54debdf4d4b509ffa9bfeae484983,
title = "Testing graph blow-up",
abstract = "Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Specifically, for every fixed graph H, we consider the set of all graphs that are obtained by a (possibly unbalanced) blow-up of H. We show a non-adaptive tester of query complexity{\~ }(1 / ε) that distinguishes graphs that are a blow-up of H from graphs that are ε-far from any such blow-up.",
author = "Lidor Avigad and Oded Goldreich",
note = "We are grateful to Dana Ron and to the anonymous reviewers of RANDOM{\textquoteright}11 for comments regarding previous versions of this work",
year = "2011",
doi = "https://doi.org/10.1007/978-3-642-22670-0_18",
language = "الإنجليزيّة",
isbn = "9783642226694",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "156--172",
editor = "Oded Goldreich",
booktitle = "Studies in Complexity and Cryptography",
}