On Rivest-Vuillemin Conjecture for Fourteen Variables
Computational Complexity
2017-01-11 v1
Abstract
A boolean function is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function is \textit{elusive} if we have to check all ,..., to determine the output of in the worst-case. It is conjectured that every nontrivial monotone weakly symmetric boolean function is elusive, which has been open for a long time. In this paper, we report that this conjecture is true for .
Keywords
Cite
@article{arxiv.1701.02374,
title = {On Rivest-Vuillemin Conjecture for Fourteen Variables},
author = {Guangmo Tong and Weili Wu and Ding-Zhu Du},
journal= {arXiv preprint arXiv:1701.02374},
year = {2017}
}
Comments
A technique report