Reimer's inequality and tardos' conjecture


(MATH) Let <i>f</i>: {0,1}<sup>n</sup> → {0,1} be a boolean function. For ε&roe; 0 <i>D<inf>e</inf></i>(<i>f</i>) be the minimum depth of a decision tree for <i>f</i> that makes an error for &xie;ε fraction of the inputs &khar; &Egr; {0,1}<sup>n</sup>. We also make an appropriate definition of the approximate certificate complexity of <i>f</i>, <i>C<inf… (More)
DOI: 10.1145/509907.509942


  • Presentations referencing similar topics