Cited in
(only showing first 100 items - show all)- Invariance groups of finite functions and orbit equivalence of permutation groups.
- On existence of ex post Nash consistent representation for effectivity functions
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity
- Fuzzy relational equations with min-biimplication composition
- On lengths of edge-labeled graph expressions
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- Logical analysis of data: classification with justification
- Galois theory for sets of operations closed under permutation, cylindrification, and composition
- Decomposing 1-Sperner hypergraphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Super-Boolean functions and free Boolean quasilattices.
- A characterization of nested canalyzing functions with maximum average sensitivity
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
- Classification of combined action of binary factors and Coxeter groups
- Boolean function metrics can assist modelers to check and choose logical rules
- Computing Shapley effects for sensitivity analysis
- Lower bounds for Boolean circuits of bounded negation width
- Estimation of expressions' complexities for two-terminal directed acyclic graphs
- Dirichlet product for Boolean functions
- Joint realizability of monotone Boolean functions
- Pattern definition of the \(p\)-efficiency concept
- scientific article; zbMATH DE number 7286679 (Why is no real title available?)
- Notes on hazard-free circuits
- Linear read-once and related Boolean functions
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- The complexity of AND-decomposition of Boolean functions
- The complexity of valued CSPs
- Community structure inspired algorithms for SAT and \#SAT
- Nondeterminisic sublinear time has measure 0 in P
- Competitive evaluation of threshold functions in the priced information model
- On a class of graphs between threshold and total domishold graphs
- The Decomposition Tree for analyses of Boolean functions
- On algebraic expressions of directed grid graphs
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- caspo
- CoLoMoTo
- A semi-tensor product approach to pseudo-Boolean functions with application to Boolean control networks
- On the readability of monotone Boolean formulae
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Recursions for modified Walsh transforms of some families of Boolean functions
- On the complexity of minimizing median normal forms of monotone Boolean functions and lattice polynomials
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- About some UP-based polynomial fragments of SAT
- Dualization of Boolean functions using ternary decision diagrams
- On algebraic immunity of trace inverse functions on finite fields of characteristic two
- 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
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- Forms of representation for simple games: sizes, conversions and equivalences
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Approximating Boolean functions with depth-2 circuits
- Counting and enumerating aggregate classifiers
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
- Super-De Morgan functions and free De Morgan quasilattices
- Locally monotone Boolean and pseudo-Boolean functions
- Quadratization of symmetric pseudo-Boolean functions
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- An iterative method for linear decomposition of index generating functions
- On the efficiency of normal form systems for representing Boolean functions
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- pystablemotifs
- Implementing efficient All solutions SAT solvers
- Minimal and locally minimal games and game forms
- On effectivity functions of game forms
- Quadratic reformulations of nonlinear binary optimization problems
- Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints
- Linear separation of connected dominating sets in graphs
- 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)
- On Boolean threshold functions with minimum specification number
- Boole-De Morgan bilattices
- Hyperidentities and related concepts. II
- The power of linear programming for general-valued CSPs
- The give-up problem for blocked regional lists with multi-winners
- Hyperidentities and related concepts. I
- Autark assignments of Horn CNFs
- Acyclic, or totally tight, two-person game forms: characterization and main properties
- A functional completeness theorem for De Morgan functions.
- Representing fitness landscapes by valued constraints to understand the complexity of local search
- New width parameters for SAT and \#SAT
- The multiple facets of the canonical direct unit implicational basis
- Monotone bargaining is Nash-solvable
- On the Readability of Monotone Boolean Formulae
- Extended box clustering for classification problems
- Compact quadratizations for pseudo-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
- Berge-acyclic multilinear 0-1 optimization problems
- The power of Sherali-Adams relaxations for general-valued CSPs
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- Characterization of zigzag De Morgan functions
- Disjointed sum of products by a novel technique of orthogonalizing ORing
- On Tackling Explanation Redundancy in Decision Trees
- k-maxitive Sugeno integrals as aggregation models for ordinal preferences
This page was built for software: JBool
