From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
From MaRDI portal
Publication:3820646
Recommendations
- On the functional separability of Boolean threshold functions
- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
- On linear decomposition of Boolean functions
- Partially unate Boolean functions: properties of their sum-of-products representations
- Universal functions for classes of bilinear and polylinear Boolean functions
- Boolean functions on \(S_n\) which are nearly linear
- On a property of linear Boolean functions
- scientific article; zbMATH DE number 1076147
- On the uniform id-decomposability of Boolean functions
- On minimal realizations of linear Boolean functions
Cited in
(14)- Unimodular functions
- Completely unimodal numberings of a simple polytope
- The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions
- Recognition problems for special classes of polynomials in 0-1 variables
- On the \(k\)-systems of a simple polytope
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
- Recognition of a class of unimodular functions
- scientific article; zbMATH DE number 4162661 (Why is no real title available?)
- scientific article; zbMATH DE number 1182572 (Why is no real title available?)
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Combinatorial structure and randomized subexponential algorithms for infinite games
- On anonymous and weighted voting systems
- Cyclic games and linear programming
This page was built for publication: From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820646)
