A Nearly-Quadratic Gap Between Adaptive and Non-Adaptive Property Testers
<p>We show that for all integers t ≥ 8 and arbitrarily small ε > 0, there exists a graph property Π (which depends on ε) such that ε-testing Π has non-adaptive query complexity Q = Θ(q<sup>2-2/t</sup>), where q = Õ(ε<sup>-1</sup>) is the adaptive query complexit...