Publication:3077976
From MaRDI portal
zbMath1237.06001MaRDI QIDQ3077976
No author found.
Publication date: 18 February 2011
computational complexity; integer programming; duality; normal forms; Boolean functions; Boolean expressions; logic circuits; Boolean programming; threshold functions; Boolean equations; read-once functions; pseudo-Boolean functions; prime implicants; Horn functions; quadratic Boolean functions; logic minimization; partially defined Boolean functions; \texttt{JBool}; applications of Boolean functions; Boolean algorithms; characterizations by functional equations; quadratic Boolean equations; separating structure
06E30: Boolean functions
06-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to ordered structures
Related Items
Quadratization of symmetric pseudo-Boolean functions, Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization, Totally optimal decision trees for Boolean functions, A new time-independent reliability importance measure, On Davis-Putnam reductions for minimally unsatisfiable clause-sets, Super-De Morgan functions and free De Morgan quasilattices, Galois theory for sets of operations closed under permutation, cylindrification, and composition, Locally monotone Boolean and pseudo-Boolean functions, Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs, On a class of graphs between threshold and total domishold graphs, The joy of implications, aka pure Horn formulas: mainly a survey, Efficient minimization of higher order submodular functions using monotonic Boolean functions, Prominent classes of the most general subsumptive solutions of Boolean equations, About some UP-based polynomial fragments of SAT, Dualization of Boolean functions using ternary decision diagrams, Quadratic reformulations of nonlinear binary optimization problems, The give-up problem for blocked regional lists with multi-winners, On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems, Logical analysis of data: classification with justification, Competitive evaluation of threshold functions in the priced information model, Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions, Extended box clustering for classification problems, A functional completeness theorem for De Morgan functions., On implicational bases of closure systems with unique critical sets., On anonymous and weighted voting systems, Unsupervised learnable neuron model with nonlinear interaction on dendrites, On existence of ex post Nash consistent representation for effectivity functions, Forms of representation for simple games: sizes, conversions and equivalences, Counting and enumerating aggregate classifiers, Discrete piecewise linear functions, Minimal and locally minimal games and game forms, Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints, A characterization of nested canalyzing functions with maximum average sensitivity, Representation-compatible power indices, Disjointed sum of products by a novel technique of orthogonalizing ORing, On the nonlinearity of monotone Boolean functions, Critical and maximum independent sets of a graph, Dirichlet product for Boolean functions, Minimal sets on propositional formulae. Problems and reductions, Optimal resource allocation enables mathematical exploration of microbial metabolic configurations, Submodular goal value of Boolean functions, Cut approach to invariance groups of lattice-valued functions, Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior, On logical bifurcation diagrams, Autark assignments of Horn CNFs, A class of valid inequalities for multilinear 0-1 optimization problems, A three-person deterministic graphical game without Nash equilibria, An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF), \(k\)-maxitive Sugeno integrals as aggregation models for ordinal preferences, Monotone bargaining is Nash-solvable, Linear read-once and related Boolean functions, Fuzzy relational equations with min-biimplication composition, On the efficiency of normal form systems for representing Boolean functions, Berge-acyclic multilinear 0-1 optimization problems, Computing maximal and minimal trap spaces of Boolean networks, Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity, Translating between the representations of a ranked convex geometry, Boolean spectral analysis in categorical reservoir modeling, Critical properties and complexity measures of read-once Boolean functions, Matroid optimization problems with monotone monomials in the objective, Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems, Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths, On Boolean threshold functions with minimum specification number, Variable-depth simulation of most permissive Boolean networks, MCP: capturing big data by satisfiability (tool description), Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements, The read once formula of a series-parallel network, The complexity of AND-decomposition of Boolean functions, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, Approximate bit dependency analysis to identify program synthesis problems as infeasible, New width parameters for SAT and \#SAT, On read-once functions over \(\mathbb{Z}_3\), De Morgan functions and free De Morgan algebras., Hardness results for approximate pure Horn CNF formulae minimization, Invariance groups of finite functions and orbit equivalence of permutation groups., On effectivity functions of game forms, Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case, Compact quadratizations for pseudo-Boolean functions, Decomposing 1-Sperner hypergraphs, An iterative method for linear decomposition of index generating functions, Exact bounds of the Möbius inverse of monotone set functions, Generalising unit-refutation completeness and SLUR via nested input resolution, A representation of antimatroids by Horn rules and its application to educational systems, Two more characterizations of König-Egerváry graphs, Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device, On algebraic immunity of trace inverse functions on finite fields of characteristic two, Approximately classic judgement aggregation, Counting inequivalent monotone Boolean functions., Boolean functions with long prime implicants, A Boolean theory of signatures for tonal scales, Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games, Boolean function metrics can assist modelers to check and choose logical rules, Joint realizability of monotone Boolean functions, Lower bounds for Boolean circuits of bounded negation width, A logic for binary classifiers and their explanation, Separable and equatable hypergraphs, SUPER-BOOLEAN FUNCTIONS AND FREE BOOLEAN QUASILATTICES, Generalising and Unifying SLUR and Unit-Refutation Completeness, A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks, Oblivious bounds on the probability of boolean functions, Unnamed Item, Unnamed Item, Lyapunov-Based Stability and Construction of Lyapunov Functions for Boolean Networks, A Tractable Class of Binary VCSPs via M-Convex Intersection, Notes on Hazard-Free Circuits, Unnamed Item, Unnamed Item, Classification of combined action of binary factors and Coxeter groups, On Tackling Explanation Redundancy in Decision Trees, Funciones booleanas, bases de Grobner y cuasigrupos, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, The Complexity of Valued CSPs, Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search, FUNCTIONAL DECOMPOSABILITY CRITERIA FOR QUADRATIC THRESHOLD BOOLEAN FUNCTIONS, Computing Shapley Effects for Sensitivity Analysis, Linear separation of connected dominating sets in graphs, The Power of Linear Programming for General-Valued CSPs, Implementing Efficient All Solutions SAT Solvers, The Complexity of General-Valued CSPs, The Power of Sherali--Adams Relaxations for General-Valued CSPs, Unnamed Item, A lower bound on CNF encodings of the at-most-one constraint, Approximating Minimum Representations of Key Horn Functions, A first polynomial non-clausal class in many-valued logic, Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles, The Boolean Determinant Calculus, Partially unate Boolean functions: properties of their sum-of-products representations, Classifying 1D elementary cellular automata with the 0-1 test for chaos, On the (complete) reasons behind decisions, Adaptive Importance Sampling Based on Fault Tree Analysis for Piecewise Deterministic Markov Process, Union-closed sets and Horn Boolean functions, 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, Invariant inference with provable complexity from the monotone theory, Matroid Horn functions, Irreducible subcube partitions, On linear rewriting systems for Boolean logic and some applications to proof theory, Characterization of zigzag De Morgan functions, Approximating Boolean Functions with Depth-2 Circuits, Community Structure Inspired Algorithms for SAT and #SAT
Uses Software
