Nontrivial monotone weakly symmetric Boo
โ
Gao Sui-Xiang; Hu Xiao-Dong; Wu Weili
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 268 KB
A Boolean function \_/+I,. . ,x,,) is elusive if every decision tree evaluating f must examine all n variables in the worst case. Rivest and Vuillemin conjectured that every nontrivial monotone weakly symmetric Boolean function is elusive. In this note, we show that this conjecture is true for n = 6