A characterization of testable hypergraph properties

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 24
  • Download : 0
We provide a combinatorial characterization of all testable properties of k-graphs (i.e. k-uniform hypergraphs). Here, a k-graph property P is testable if there is a randomized algorithm which makes a bounded number of edge queries and distinguishes with probability 2/3 between k-graphs that satisfy P and those that are far from satisfying P. For the 2-graph case, such a combinatorial characterization was obtained by Alon, Fischer, Newman and Shapira. Our results for the k-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 3-graph setting.
Publisher
IEEE Computer Society Technical Committee on the Mathematical Foundations of Computing (TCMF)
Issue Date
2017-10-16
Language
English
Citation

58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017, pp.859 - 867

DOI
10.1109/FOCS.2017.84
URI
http://hdl.handle.net/10203/279872
Appears in Collection
MA-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0