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