JBool
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Minimal and locally minimal games and game forms
- caspo
- CoLoMoTo
- 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
- Dirichlet product for Boolean functions
- Minimal sets on propositional formulae. Problems and reductions
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations
- On algebraic expressions of directed grid graphs
- 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
- VBASim
- Fuzzy relational equations with min-biimplication composition
- Pattern definition of the \(p\)-efficiency concept
- BoolNet
- On the efficiency of normal form systems for representing Boolean functions
- Berge-acyclic multilinear 0-1 optimization problems
- Nondeterminisic sublinear time has measure 0 in P
- 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
- MOCHA
- Matroid optimization problems with monotone monomials in the objective
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
- Recursions for modified Walsh transforms of some families of Boolean functions
- On Boolean threshold functions with minimum specification number
- MCP: capturing big data by satisfiability (tool description)
- Testing read-once functions in a median-augmented element basis
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
- On lengths of edge-labeled graph expressions
- RAKAPOSHI
- The complexity of AND-decomposition of Boolean functions
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
- New width parameters for SAT and \#SAT
- 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
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
- Ltur
- A representation of antimatroids by Horn rules and its application to educational systems
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Estimation of expressions' complexities for two-terminal directed acyclic graphs
- 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
- PANDA
- Leibniz
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- Quadratization of symmetric pseudo-Boolean functions
- 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
- Solving chance-constrained optimization problems with stochastic quadratic inequalities
- Super-Boolean functions and free Boolean quasilattices.
- PATRICIA
- A semi-tensor product approach to pseudo-Boolean functions with application to Boolean control networks
- Oblivious bounds on the probability of boolean functions
- On linear rewriting systems for Boolean logic and some applications to proof theory
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- Characterization of zigzag De Morgan 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
- MIQCR-CB
- RRE
- DAGGER
- Approximating Boolean functions with depth-2 circuits
- Community structure inspired algorithms for SAT and \#SAT
- QBFEVAL
- ZRes
- Super-De Morgan functions and free De Morgan quasilattices
- Galois theory for sets of operations closed under permutation, cylindrification, and composition
- BBCPOP
- Locally monotone Boolean and pseudo-Boolean functions
- POLIP
- Lyapunov-based stability and construction of Lyapunov functions for Boolean networks
- MaBoSS
- Hyperidentities and related concepts. I
This page was built for software: JBool
