Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model

Oded Goldreich, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We study the relation between the query complexity of adaptive and non-adaptive testers in the dense graph model. It has been known for a couple of decades that the query complexity of non-adaptive testers is at most quadratic in the query complexity of adaptive testers. We show that this general result is essentially tight; that is, there exist graph properties for which any non-adaptive tester must have query complexity that is almost quadratic in the query complexity of the best general (i.e., adaptive) tester. More generally, for every q: Nrightarrow N such that q(n)≤q √n and constant c\in[1,2], we show a graph property that is testable in Θ(q(n) queries, but its non-adaptive query complexity is Θ(q(n) c}), omitting poly(log n) factors and ignoring the effect of the proximity parameter ϵ. Furthermore, the upper bounds hold for one-sided error testers, and are at most quadratic in 1/ϵ. These results are obtained through the use of general reductions that transport properties of ordered structured (like bit strings) to those of unordered structures (like unlabeled graphs). The main features of these reductions are query-efficiency and preservation of distance to the properties. This method was initiated in our prior work (ECCC, TR20-149), and we significantly extend it here.

Original languageEnglish
Title of host publicationProceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021
PublisherIEEE Computer Society
Pages269-275
Number of pages7
ISBN (Electronic)9781665420556
StatePublished - 2022
Externally publishedYes
Event62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 - Virtual, Online, United States
Duration: 7 Feb 202210 Feb 2022

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2022-February
ISSN (Print)0272-5428

Conference

Conference62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021
Country/TerritoryUnited States
CityVirtual, Online
Period7/02/2210/02/22

Bibliographical note

Publisher Copyright:
© 2022 IEEE.

Keywords

  • Non adaptive vs Adaptive queries
  • Property Testing

Fingerprint

Dive into the research topics of 'Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model'. Together they form a unique fingerprint.

Cite this