Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,735,569 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (2)
Boolean algebra
Cryptography
Majority function
Parity function
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Low Quantum Cost Construction for Adder and Symmetric Boolean Function
Kandakatla Sravanthi
,
Anam Srinivasa Reddy
2017
Corpus ID: 37272270
Reversible logic design has been one of the promising technologies gaining greater interest due to less dissipation of heat and…
Expand
2013
2013
Combinatorial method of polynomial expansion of symmetric Boolean functions
D. Gorodecky
arXiv.org
2013
Corpus ID: 6587639
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean…
Expand
2012
2012
Nonlinearity of quartic rotation symmetric Boolean functions
Liping Yang
,
Rongjun Wu
,
Shaofang Hong
arXiv.org
2012
Corpus ID: 18078999
Nonlinearity of rotation symmetric Boolean functions is an important topic on cryptography algorithm. Let $e\ge 1$ be any given…
Expand
2012
2012
The Hamming Weight and Nonlinearity of a Type of Rotation Symmetric Boolean Function
Xi Wang
2012
Corpus ID: 124767009
Rotation symmetric Boolean functions have important applications in Cryptology. In this paper,we study the fast evaluation of a…
Expand
2010
2010
Distinguishing Properties of Higher Order Derivatives of Boolean Functions
Ming Duan
,
Xuejia Lai
,
Mohan Yang
,
Xiaorui Sun
,
Bo Zhu
IACR Cryptology ePrint Archive
2010
Corpus ID: 5613218
Higher order differential cryptanalysis is based on the property of higher order derivatives of Boolean functions that the degree…
Expand
2006
2006
On the Computational Complexity of Predicting Dynamical Evolution of Large Agent Ensembles
Predrag T. Tosic
,
G. Agha
2006
Corpus ID: 237876
We study global behavior of large ensembles of simple reactive agents. We do so by applying computational complexity tools to the…
Expand
2006
2006
Walsh spectrum properties of rotation symmetric boolean function
Yongjuan Wang
,
Wen-Bao Han
,
Shi-Qu Li
Wuhan University Journal of Natural Sciences
2006
Corpus ID: 34414253
Rotation symmetric function was presented by Pieprzyk. The algebraic configuration of rotation symmetric(RotS) function is…
Expand
2005
2005
On Complexity of Counting Fixed Point Configurations in Certain Classes of Graph Automata
N. Avenue
2005
Corpus ID: 14497645
We study computational complexity of counting the fixed point configurations (FPs) in certain discrete dynamical systems. We…
Expand
1992
1992
Complexity of Symmetric Functions in Perceptron-Like Models
Zhi-Li Zhang
1992
Corpus ID: 14118051
We examine the size complexity of the symmetric boolean functions in two circuit models containing threshold gates: the d…
Expand
1992
1992
Complexity of Symmetric Functions inPerceptron-Like
Zhi-Li Zhang
,
D. A. Mix Barrington
1992
Corpus ID: 1560545
We examine the size complexity of the symmetric boolean functions in two circuit models containing threshold gates: the d…
Expand