Conjectures on the number of balanced Boolean functions of bounded degree
From MaRDI portal
Publication:3597517
Recommendations
- Counting Balanced Boolean Functions innVariables with Bounded Degree
- On a conjecture for balanced symmetric Boolean functions
- On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF
- New families of balanced symmetric functions and a generalization of Cusick, Li and Stǎnicǎ's conjecture
- Balanced Symmetric Functions Over ${\hbox{GF}}(p)$
Cited in
(13)- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- On a combinatorial conjecture of Tu and Deng
- One sufficient and necessary condition on balanced Boolean functions with \(\sigma_{f} = 2^{2n} + 2^{n+3}\) \((n \geq 3)\)
- scientific article; zbMATH DE number 4218320 (Why is no real title available?)
- On a conjecture for balanced symmetric Boolean functions
- A solution of Dedekind's problem on the number of isotone Boolean functions.
- scientific article; zbMATH DE number 919283 (Why is no real title available?)
- On the number of significant variables of balanced Boolean function with the fixed number of elementary conjunctions in its DNF
- The Degree of Balanced Elementary Symmetric Boolean Functions of <formula formulatype="inline"> <tex Notation="TeX">${{\bf 4k}+{\bf 3}}$</tex> </formula> Variables
- Counting Balanced Boolean Functions innVariables with Bounded Degree
- An upper bound on the number of iterations for transforming a Boolean function of degree greater or equal than 4 to a function of degree 3
- A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code
- Counting balanced Boolean functions for some degree
This page was built for publication: Conjectures on the number of balanced Boolean functions of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597517)