Rivest-Vuillemin Conjecture Is True for Monotone Boolean Functions with Twelve Variables
2000-10-02
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Rivest-Vuillemin Conjecture Is True for Monotone Boolean Functions with Twelve Variables
Published Date
2000-10-02
Publisher
Type
Report
Abstract
A Boolean function f(x1, x2, …, xn) is elusive if every decision tree computing f must examine all n variables in the worst case. It is a long-standing conjecture that every non-trivial monotone weakly symmetric Boolean function is elusive. In this paper, we prove this conjecture for Boolean functions with twelve variables.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Gao, Sui-xiang; Du, Ding-Zhu; Hu, Xiao-dong; Jia, Xiaohua. (2000). Rivest-Vuillemin Conjecture Is True for Monotone Boolean Functions with Twelve Variables. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215438.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.