2 research outputs found
A characterization of testable hypergraph properties
We provide a combinatorial characterization of all testable properties of
-graphs (i.e. -uniform hypergraphs). Here, a -graph property
is testable if there is a randomized algorithm which makes a
bounded number of edge queries and distinguishes with probability between
-graphs that satisfy and those that are far from satisfying
. For the -graph case, such a combinatorial characterization was
obtained by Alon, Fischer, Newman and Shapira. Our results for the -graph
setting are in contrast to those of Austin and Tao, who showed that for the
somewhat stronger concept of local repairability, the testability results for
graphs do not extend to the -graph setting.Comment: 82 pages; extended abstract of this paper appears in FOCS 201