JBool

swMATH6185MaRDI QIDQ18319

No author found.

Related Items (only showing first 100 items - show all)

Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints ⋮ Testing read-once functions in a median-augmented element basis ⋮ 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 ⋮ On lengths of edge-labeled graph expressions ⋮ 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 ⋮ Dirichlet product for Boolean functions ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ 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 ⋮ Estimation of expressions' complexities for two-terminal directed acyclic graphs ⋮ 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 ⋮ Pattern definition of the \(p\)-efficiency concept ⋮ Unsupervised learnable neuron model with nonlinear interaction on dendrites ⋮ On algebraic expressions of directed grid graphs ⋮ 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 ⋮ 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 ⋮ Threshold Boolean form for joint probabilistic constraints with random technology matrix ⋮ On the readability of monotone Boolean formulae ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Nondeterminisic sublinear time has measure 0 in P ⋮ Hardness results for approximate pure Horn CNF formulae minimization ⋮ Computing maximal and minimal trap spaces of Boolean networks ⋮ Acyclic, or totally tight, two-person game forms: characterization and main properties ⋮ Invariance groups of finite functions and orbit equivalence of permutation groups. ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ 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. ⋮ Compact quadratizations for pseudo-Boolean functions ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Decomposing 1-Sperner hypergraphs ⋮ Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths ⋮ An iterative method for linear decomposition of index generating functions ⋮ Recursions for modified Walsh transforms of some families of Boolean functions ⋮ Minimal and locally minimal games and game forms ⋮ On Boolean threshold functions with minimum specification number ⋮ 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) ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs ⋮ Classification of combined action of binary factors and Coxeter groups ⋮ The Complexity of General-Valued CSPs

This page was built for software: JBool