Note
Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive

https://doi.org/10.1016/S0304-3975(98)00350-8Get rights and content
Under an Elsevier user license
open archive

Abstract

A Boolean function f(x1,…,xn) 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.

Keywords

Decision trees
Boolean functions
Elusive

Cited by (0)

1

Supported in part by National Natural Science Foundation of China.

2

Supported in part by the National Science Foundation under grant CCR-9530306.