Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive

DOI10.1016/S0304-3975(98)00350-8zbMath0930.68102MaRDI QIDQ1960414

Xiao-Dong Hu, Sui-Xiang Gao, Weili Wu

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Boolean functionsdecision treeselusive

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the elusiveness of Hamiltonian property ⋮ The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables

Cites Work

• A topological approach to evasiveness
• Fixed-point sets of group actions on finite acyclic complexes
• On recognizing graph properties from adjacency matrices
• The transitive groups of degree up to eleven⁺
• Unnamed Item
• Unnamed Item

This page was built for publication: Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive