scientific article; zbMATH DE number 5852793
From MaRDI portal
Publication:3077976
computational complexityinteger programmingdualitynormal formsread-once functionsBoolean functionsBoolean programmingthreshold functionspseudo-Boolean functionsBoolean equationsprime implicantslogic circuitsHorn functionsBoolean expressionsquadratic Boolean functionslogic minimizationpartially defined Boolean functions\texttt{JBool}applications of Boolean functionsBoolean algorithmscharacterizations by functional equationsquadratic Boolean equationsseparating structure
Recommendations
- scientific article; zbMATH DE number 953683
- Boolean function complexity. Advances and frontiers.
- scientific article; zbMATH DE number 4012691
- scientific article; zbMATH DE number 3880684
- scientific article; zbMATH DE number 3884230
- scientific article; zbMATH DE number 4012495
- Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis
- Boolean algebra approximations
- scientific article; zbMATH DE number 4125344
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 1848368 (Why is no real title available?)
- Linear read-once and related Boolean functions
- Representation-compatible power indices
- A tractable class of binary VCSPs via M-convex intersection
- Linear separation of connected dominating sets in graphs
- The complexity of AND-decomposition of Boolean functions
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Boolean spectral analysis in categorical reservoir modeling
- Critical properties and complexity measures of read-once Boolean functions
- Monotone bargaining is Nash-solvable
- The power of Sherali-Adams relaxations for general-valued CSPs
- A logic for binary classifiers and their explanation
- Hyperidentities and related concepts. II
- MCP: capturing big data by satisfiability (tool description)
- A three-person deterministic graphical game without Nash equilibria
- Translating between the representations of a ranked convex geometry
- Lower bounds for Boolean circuits of bounded negation width
- One-to-one correspondense between proper families of Boolean functions and unique sink orientations of cubes
- On the efficiency of normal form systems for representing Boolean functions
- Binary functions and their applications
- A representation of antimatroids by Horn rules and its application to educational systems
- Closed classes of Boolean functions. 2nd ed.
- scientific article; zbMATH DE number 1408923 (Why is no real title available?)
- scientific article; zbMATH DE number 1543344 (Why is no real title available?)
- Joint realizability of monotone Boolean functions
- Decomposing 1-Sperner hypergraphs
- Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
- The Boolean Determinant Calculus
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Matroid optimization problems with monotone monomials in the objective
- Compact quadratizations for pseudo-Boolean functions
- \(k\)-maxitive Sugeno integrals as aggregation models for ordinal preferences
- Berge-acyclic multilinear 0-1 optimization problems
- Dirichlet product for Boolean functions
- A first polynomial non-clausal class in many-valued logic
- The complexity of valued CSPs
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Characterization of zigzag De Morgan functions
- Autark assignments of Horn CNFs
- Algorithms for Boolean Function Query Properties
- Variable-depth simulation of most permissive Boolean networks
- A class of valid inequalities for multilinear 0-1 optimization problems
- Separable and equatable hypergraphs
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- scientific article; zbMATH DE number 1759421 (Why is no real title available?)
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
- Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
- Editorial: Special issue on Boolean functions and their applications
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- On logical bifurcation diagrams
- Oblivious bounds on the probability of boolean functions
- Boole-De Morgan bilattices
- Critical and maximum independent sets of a graph
- Disjointed sum of products by a novel technique of orthogonalizing ORing
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
- Cut approach to invariance groups of lattice-valued functions
- Submodular goal value of Boolean functions
- Hyperidentities and related concepts. I
- scientific article; zbMATH DE number 4083547 (Why is no real title available?)
- On the orthogonalization of arbitrary Boolean formulae
- Exact bounds of the Möbius inverse of monotone set functions
- Competitive evaluation of threshold functions in the priced information model
- A characterization of nested canalyzing functions with maximum average sensitivity
- EAGLE-STARTING AID. Technical informatics. Logical funcions -- Boolean models
- Logical analysis of data: classification with justification
- Counting and enumerating aggregate classifiers
- Hardness results for approximate pure Horn CNF formulae minimization
- On a class of graphs between threshold and total domishold graphs
- An infinite descending chain of Boolean subfunctions consisting of threshold functions
- On the nonlinearity of monotone Boolean functions
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Fuzzy relational equations with min-biimplication composition
- Counting inequivalent monotone Boolean functions.
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Unsupervised learnable neuron model with nonlinear interaction on dendrites
- Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.
- De Morgan functions and free De Morgan algebras.
- On linear rewriting systems for Boolean logic and some applications to proof theory
- On existence of ex post Nash consistent representation for effectivity functions
- Invariance groups of finite functions and orbit equivalence of permutation groups.
- Approximating Boolean functions with depth-2 circuits
- The power of linear programming for general-valued CSPs
- The give-up problem for blocked regional lists with multi-winners
- Sign-representation of Boolean functions using a small number of monomials
- scientific article; zbMATH DE number 4125344 (Why is no real title available?)
- Minimal and locally minimal games and game forms
- Prominent classes of the most general subsumptive solutions of Boolean equations
- On anonymous and weighted voting systems
- On Boolean threshold functions with minimum specification number
- On effectivity functions of game forms
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Super-De Morgan functions and free De Morgan quasilattices
- On implicational bases of closure systems with unique critical sets.
- scientific article; zbMATH DE number 49082 (Why is no real title available?)
- scientific article; zbMATH DE number 1963548 (Why is no real title available?)
- Forms of representation for simple games: sizes, conversions and equivalences
- A functional completeness theorem for De Morgan functions.
- Monotone Boolean functions
- Galois theory for sets of operations closed under permutation, cylindrification, and composition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077976)