scientific article; zbMATH DE number 5852793

zbMATH Open1237.06001MaRDI QIDQ3077976FDOQ3077976

Authors:

Publication date: 18 February 2011

Title of this publication is not available (Why is that?)

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

Boolean functions (06E30) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to ordered structures (06-00)

Cited In (only showing first 100 items - show all)

The Power of Sherali--Adams Relaxations for General-Valued CSPs
A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
Title not available (Why is that?)
Variable-depth simulation of most permissive Boolean networks
On the efficiency of normal form systems for representing Boolean functions
Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
Linear separation of connected dominating sets in graphs
Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior
On logical bifurcation diagrams
MCP: capturing big data by satisfiability (tool description)
Autark assignments of Horn CNFs
Computing Shapley Effects for Sensitivity Analysis
The Complexity of Valued CSPs
Monotone bargaining is Nash-solvable
The Boolean Determinant Calculus
Compact quadratizations for pseudo-Boolean functions
Representation-compatible power indices
Berge-acyclic multilinear 0-1 optimization problems
Characterization of zigzag De Morgan functions
Disjointed sum of products by a novel technique of orthogonalizing ORing
\(k\)-maxitive Sugeno integrals as aggregation models for ordinal preferences
A class of valid inequalities for multilinear 0-1 optimization problems
Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
Oblivious bounds on the probability of boolean functions
Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
A lower bound on CNF encodings of the at-most-one constraint
A logic for binary classifiers and their explanation
Translating between the representations of a ranked convex geometry
Matroid optimization problems with monotone monomials in the objective
Separable and equatable hypergraphs
A three-person deterministic graphical game without Nash equilibria
Boolean spectral analysis in categorical reservoir modeling
Critical properties and complexity measures of read-once Boolean functions
Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
Title not available (Why is that?)
Algorithms for Boolean Function Query Properties
An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
Critical and maximum independent sets of a graph
Decomposing 1-Sperner hypergraphs
The read once formula of a series-parallel network
Lower bounds for Boolean circuits of bounded negation width
Joint realizability of monotone Boolean functions
Dirichlet product for Boolean functions
Editorial: Special issue on Boolean functions and their applications
Linear read-once and related Boolean functions
Binary functions and their applications
Title not available (Why is that?)
Title not available (Why is that?)
The complexity of AND-decomposition of Boolean functions
Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A first polynomial non-clausal class in many-valued logic
Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
Title not available (Why is that?)
Closed classes of Boolean functions. 2nd ed.
Cut approach to invariance groups of lattice-valued functions
Submodular goal value of Boolean functions
A representation of antimatroids by Horn rules and its application to educational systems
A Tractable Class of Binary VCSPs via M-Convex Intersection
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
An iterative method for linear decomposition of index generating functions
Boolean proportions
Union-closed sets and Horn Boolean functions
Learning decision catalogues for situated decision making: the case of scoring systems
On the failings of Shapley values for explainability
A Boolean theory of signatures for tonal scales
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
Approximating Minimum Representations of Key Horn Functions
Notes on Hazard-Free Circuits
Approximate bit dependency analysis to identify program synthesis problems as infeasible
Title not available (Why is that?)
New width parameters for SAT and \#SAT
On read-once functions over \(\mathbb{Z}_3\)
Tree-shellability of Boolean functions
Title not available (Why is that?)
Lattice structures that parameterize regulatory network dynamics
Partially unate Boolean functions: properties of their sum-of-products representations
Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.
Title not available (Why is that?)
Boolean functions with long prime implicants
FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS
Set-theoretical Constructions of Boolean Functions and theirs Applications in Logic Synthesis
Disjoint Boolean Products via Shannon's Expansion
Matroid Horn functions
Title not available (Why is that?)
Invariant inference with provable complexity from the monotone theory
Irreducible subcube partitions
Computational complexity of minimal trap spaces in Boolean networks
Classification of combined action of binary factors and Coxeter groups
Boolean function metrics can assist modelers to check and choose logical rules
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
Notes on Boolean read-\(k\) and multilinear circuits
Title not available (Why is that?)

Uses Software

JBool
Chaff
Leibniz

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)