Live briefing
Everything about Symmetric Boolean function
Boolean function whose output depends only on the number of true inputs
In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the order of its input bits, i.e., it depends only on the number of ones in the input. For this reason, they are also known as Boolean counting functions. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Symmetric Boolean functionA 5-minute orientation
- Skim a recent paper: Symbolic dynamics and rotation symmetric Boolean functionsInfluential work since 2022
- Pick up a classic book: Boolean FunctionsThe most-reprinted book on the subject
- Read the landmark paper: Rotation symmetric Boolean functions—Count and cryptographic propertiesCited 121 times
- Go sideways: Boolean functionA closely related topic
- Go sideways: Algebraic normal formA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Rotation symmetric Boolean functions—Count and cryptographic properties
Symmetric Boolean Functions
Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
Balancedness and correlation immunity of symmetric Boolean functions
Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions
Quadratization of symmetric pseudo-Boolean functions
On the number of rotation symmetric Boolean functions
On a conjecture for balanced symmetric Boolean functions
🆕 Influential since 2022
Symbolic dynamics and rotation symmetric Boolean functions
Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms
Construction and enumeration of balanced rotation symmetric Boolean functions
Using easy coefficients conjecture for rotation symmetric Boolean functions
The Stochastic Boolean Function Evaluation problem for symmetric Boolean functions
📚 Books worth reading
- 📕Boolean FunctionsAllen Hines · 2015
- 📕Bounds on decision trees for monotonic Boolean functionsY. Breitbart · 1974
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Boolean function In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {−1,1})…
- Algebraic normal form Algebraic normal form (ANF) is a representation of functions in boolean algebra. Formulas written in ANF are also known as ring sum normal form (RSNF or…
- Boolean algebras canonically defined Boolean algebras are models of the equational theory of two values; this definition is equivalent to the lattice and ring definitions. Boolean algebra…
- Parity function In Boolean algebra, a parity function is a Boolean function whose value is one if and only if the input vector has an odd number of ones. The parity function…
- Multiparty communication complexity In theoretical computer science, multiparty communication complexity is the study of communication complexity in the setting where there are more than…
- Multilinear polynomial In algebra, a multilinear polynomial is a multivariate polynomial that is linear (meaning affine) in each of its variables separately, but not necessarily…
- Reed–Muller code Reed–Muller codes are error-correcting codes that are used in wireless communications applications, particularly in deep-space communication. In cryptography…
- Wick product In probability theory, the Wick product, named for Italian physicist Gian-Carlo Wick, is a particular way of defining an adjusted product of a set of random…