Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive

@inproceedings{Kulkarni2013AnyMP,
  title={Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive},
  author={Raghav Kulkarni and Youming Qiao and Xiaoming Sun},
  booktitle={Electronic Colloquium on Computational Complexity},
  year={2013}
}
For a Boolean function f, let D(f) denote its deterministic decision tree complexity, i.e., minimum number of (adaptive) queries required in worst case in order to determine f. In a classic paper, Rivest and Vuillemin [19] show that any non-constant monotone property P : {0, 1}( n 2) → {0, 1} of n-vertex graphs has D(P) = Ω(n). We extend their result to 3-uniform hypergraphs. In particular, we show that any non-constant monotone property P : {0, 1}( n 3) → {0, 1} of nvertex 3-uniform… CONTINUE READING
4 Citations
30 References
Similar Papers

Similar Papers

Loading similar papers…