Skip to search formSkip to main contentSkip to account menu

Symmetric Boolean function

In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the permutation of its input bits, i.e., it depends… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (2)

Boolean algebraCryptography
Majority functionParity function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Weight Recursions for Any Rotation Symmetric Boolean Functions
Let <inline-formula> <tex-math notation="LaTeX">$f_{n}(x_{1}, x_{2}, \ldots, x_{n})$ </tex-math></inline-formula> denote the… 
2016
2016
Recent Results on Balanced Symmetric Boolean Functions
This paper focuses on the balancedness of symmetric Boolean functions. We prove a conjecture presented by Canteaut and Videau… 
Highly Cited
2013
Highly Cited
2013
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
2010
2010
Optimal computation of symmetric Boolean functions in tree networks
In this paper, we address the scenario where nodes with sensor data are connected in a tree network, and every node wants to… 
2009
2009
On the Symmetric Negabent Boolean Functions
We study the negabent Boolean functions which are symmetric. The Boolean function which has equal absolute spectral values under… 
2008
2008
On the 2m-variable symmetric Boolean functions with maximum algebraic immunity
  • Longjiang QuC. Li
  • Science in China Series F: Information Sciences
  • 2008
  • Corpus ID: 20797867
The properties of the 2m-variable symmetric Boolean functions with maximum algebraic immunity are studied in this paper. Their… 
Highly Cited
2006
Highly Cited
2006
Complexity of reachability problems for finite discrete dynamical systems
Highly Cited
2005
Highly Cited
2005
On the computational power of probabilistic and quantum branching program
1997
1997
On the linear structure of symmetric Boolean functions
It is shown in this paper that nonlinear symmetric Boolean functions have no linear structures other than the all-zero and the… 
1976
1976
On the combinational complexity of certain symmetric Boolean functions
A property of the truth table of a symmetric Boolean function is given from which one can infer a lower bound on the minimal… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)