English

On Rivest-Vuillemin Conjecture for Fourteen Variables

Computational Complexity 2017-01-11 v1

Abstract

A boolean function f(x1,...,xn)f(x_1,...,x_n) is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function f(x1,...,xn)f(x_1,...,x_n) is \textit{elusive} if we have to check all x1x_1,..., xnx_n to determine the output of f(x1,...,xn)f(x_1,...,x_n) 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 n=14n=14.

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