Live briefing
Everything about Boolean function
Function returning one of only two values
In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set. Alternative names are switching function, used especially in older computer science literature, and truth function, used in logic. Boolean functions are the subject of Boolean algebra and switching theory. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Boolean functionA 5-minute orientation
- Skim a recent paper: Robust stability of Switched Boolean Networks with function perturbationInfluential work since 2022
- Pick up a classic book: Cardinal Invariants on Boolean AlgebrasThe most-reprinted book on the subject
- Read the landmark paper: Graph-Based Algorithms for Boolean Function ManipulationCited 6,112 times
- Go sideways: Symmetric 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)
Graph-Based Algorithms for Boolean Function Manipulation
Function perturbations on singular Boolean networks
A Boolean function requiring 3n network size
On a new Boolean function with applications
Minimization of a quadratic pseudo-Boolean function
Equational characterizations of Boolean function classes
The threshold order of a Boolean function
Variance function of boolean additive convolution
🆕 Influential since 2022
Robust stability of Switched Boolean Networks with function perturbation
Reachability, Controllability, and Stabilization of Boolean Control Networks With Stochastic Function Perturbations
Robust set stability of probabilistic Boolean networks under general stochastic function perturbation
Cluster Synchronization of Boolean Networks Under Probabilistic Function Perturbation
Boolean Logic Function Realized by Phase-Change Blade Type Random Access Memory
📚 Books worth reading
Cardinal Invariants on Boolean AlgebrasJ. Donald Monk · 2010
Bent FunctionsSihem Mesnager · 2016
Bent FunctionsNatalia Tokareva · 2015
Operator Algebras Generated by Commuting ProjectionsWerner Ricker · 1999
Boolean Algebras in AnalysisD. A. Vladimirov · 2009
Compact numerical methods for computersJohn C. Nash · 1979- 📕Dizʹi͡unktivnye normalʹnye formy bulevykh funkt͡siĭ s malym chislom nuleĭA. I͡U Kogan · 1986
- 📕Opredelenie pol͡iusa bulevykh funk͡tsiĭS. I. Gurov · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Symmetric Boolean function 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…
- 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…
- Linearity In mathematics, the term linear is used in two distinct senses for two different properties: linearity of a function (or mapping); linearity of a polynomial…
- 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…
- Bent function In the mathematical field of combinatorics, a bent function is a Boolean function that is maximally non-linear; it is as different as possible from the…
- Boolean algebra In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the…
- 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…
- 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…