Learn More
In this thesis, we continue the work of Goldreich and Ron in (ECCC 2008) by presenting an innite family of natural properties of dense graphs having non-adaptive testers of query complexity of˜O(1//) , where is the proximity parameter. Specically, for every xed graph H , we show a non-adaptive tester of query complexity˜O(−1) for the property of being a(More)
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(More)
  • 1