Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > GROUP ACTIONS:
Reports tagged with group actions:
TR14-061 | 21st April 2014
Raghav Kulkarni, Youming Qiao, Xiaoming Sun

#### Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive

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 \cite{rv} show that any non-constant monotone property \$\mathcal{P} : \{0, 1\}^{n \choose 2} \to ... more >>>

ISSN 1433-8092 | Imprint