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)- Submodular maximization and its generalization through an intersection cut lens
- Counting and enumerating aggregate classifiers
- On anonymous and weighted voting systems
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process
- Variable-depth simulation of most permissive Boolean networks
- scientific article; zbMATH DE number 1408923 (Why is no real title available?)
- Super-De Morgan functions and free De Morgan quasilattices
- Locally monotone Boolean and pseudo-Boolean functions
- Quadratization of symmetric pseudo-Boolean functions
- Monotone Boolean functions
- Analysis of Boolean Functions
- An iterative method for linear decomposition of index generating functions
- On the efficiency of normal form systems for representing Boolean functions
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- Implementing efficient All solutions SAT solvers
- Minimal and locally minimal games and game forms
- Boolean proportions
- On effectivity functions of game forms
- Quadratic reformulations of nonlinear binary optimization problems
- Two more characterizations of König-Egerváry graphs
- Union-closed sets and Horn Boolean functions
- Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
- Linear separation of connected dominating sets in graphs
- A Boolean theory of signatures for tonal scales
- Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
- On logical bifurcation diagrams
- Approximately classic judgement aggregation
- MCP: capturing big data by satisfiability (tool description)
- Learning decision catalogues for situated decision making: the case of scoring systems
- On the failings of Shapley values for explainability
- On Boolean threshold functions with minimum specification number
- Boole-De Morgan bilattices
- Probabilistic scoring lists for interpretable machine learning
- Hyperidentities and related concepts. II
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
- Three views on dependency covers from an FCA perspective
- Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
- Boolean dynamics revisited through feedback interconnections
- Incomplete cooperative games with player-centered information
- The power of linear programming for general-valued CSPs
- Sign-representation of Boolean functions using a small number of monomials
- The give-up problem for blocked regional lists with multi-winners
- Hyperidentities and related concepts. I
- Autark assignments of Horn CNFs
- Advanced Boolean Techniques
- On a quasi-ordering on Boolean functions
- Approximate bit dependency analysis to identify program synthesis problems as infeasible
- A functional completeness theorem for De Morgan functions.
- Representing fitness landscapes by valued constraints to understand the complexity of local search
- scientific article; zbMATH DE number 4134113 (Why is no real title available?)
- New width parameters for SAT and \#SAT
- On read-once functions over \(\mathbb{Z}_3\)
- Monotone bargaining is Nash-solvable
- Extended box clustering for classification problems
- scientific article; zbMATH DE number 107561 (Why is no real title available?)
- Compact quadratizations for pseudo-Boolean functions
- Tree-shellability of Boolean functions
- Minimal sets on propositional formulae. Problems and reductions
- Computing maximal and minimal trap spaces of Boolean networks
- Representation-compatible power indices
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case
- scientific article; zbMATH DE number 3599956 (Why is no real title available?)
- The Boolean Determinant Calculus
- Lattice structures that parameterize regulatory network dynamics
- Berge-acyclic multilinear 0-1 optimization problems
- The power of Sherali-Adams relaxations for general-valued CSPs
- Characterization of zigzag De Morgan functions
- Partially unate Boolean functions: properties of their sum-of-products representations
- Generalising and unifying SLUR and unit-refutation completeness
- scientific article; zbMATH DE number 1634465 (Why is no real title available?)
- Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.
- Synchronous dynamical systems on directed acyclic graphs: complexity and algorithms
- Disjointed sum of products by a novel technique of orthogonalizing ORing
- On Tackling Explanation Redundancy in Decision Trees
- Investigation of some subclasses of multiaffine, bijunctive, weakly positive and weakly negative Boolean functions
- k-maxitive Sugeno integrals as aggregation models for ordinal preferences
- A tractable class of binary VCSPs via M-convex intersection
- A combinatorial approach for small and strong formulations of disjunctive constraints
- A class of valid inequalities for multilinear 0-1 optimization problems
- Prominent classes of the most general subsumptive solutions of Boolean equations
- On the nonlinearity of monotone Boolean functions
- Hardness results for approximate pure Horn CNF formulae minimization
- Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
- Equational characterizations of Boolean function classes
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- Discrete piecewise linear functions
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
- Oblivious bounds on the probability of boolean functions
- Translating between the representations of a ranked convex geometry
- Boolean functions with long prime implicants
- De Morgan functions and free De Morgan algebras.
- A logic for binary classifiers and their explanation
- On linear rewriting systems for Boolean logic and some applications to proof theory
- Matroid optimization problems with monotone monomials in the objective
- FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
- An infinite descending chain of Boolean subfunctions consisting of threshold functions
- Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis
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)