The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables

DOI10.1006/jcom.1999.0521zbMath0949.68116OpenAlexW2051936011WikidataQ123262903 ScholiaQ123262903MaRDI QIDQ1578507

Weili Wu, Sui-Xiang Gao, Ding-Zhu Du, Xiao-Dong Hu

Publication date: 3 September 2000

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1999.0521

zbMATH Keywords

decision treeBoolean function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On the elusiveness of Hamiltonian property

Cites Work

• A topological approach to evasiveness
• Fixed-point sets of group actions on finite acyclic complexes
• On recognizing graph properties from adjacency matrices
• Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
• The transitive groups of degree up to eleven⁺
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables