The following pages link to (Q3077976):
Displayed 50 items.
- Fuzzy relational equations with min-biimplication composition (Q1927264) (← links)
- On the efficiency of normal form systems for representing Boolean functions (Q1989340) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Computing maximal and minimal trap spaces of Boolean networks (Q2003486) (← links)
- Enumerating and categorizing positive Boolean functions separable by a \(k\)-additive capacity (Q2012049) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Boolean spectral analysis in categorical reservoir modeling (Q2040680) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems (Q2069675) (← links)
- Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths (Q2074348) (← links)
- On Boolean threshold functions with minimum specification number (Q2105416) (← links)
- Variable-depth simulation of most permissive Boolean networks (Q2112147) (← links)
- MCP: capturing big data by satisfiability (tool description) (Q2118299) (← links)
- Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
- The read once formula of a series-parallel network (Q2166241) (← links)
- The complexity of AND-decomposition of Boolean functions (Q2181249) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- Approximate bit dependency analysis to identify program synthesis problems as infeasible (Q2234084) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- On read-once functions over \(\mathbb{Z}_3\) (Q2241355) (← links)
- De Morgan functions and free De Morgan algebras. (Q2248023) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Invariance groups of finite functions and orbit equivalence of permutation groups. (Q2257470) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- An iterative method for linear decomposition of index generating functions (Q2325307) (← links)
- Exact bounds of the Möbius inverse of monotone set functions (Q2345593) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- A representation of antimatroids by Horn rules and its application to educational systems (Q2403022) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device (Q2411545) (← links)
- On algebraic immunity of trace inverse functions on finite fields of characteristic two (Q2416536) (← links)
- Approximately classic judgement aggregation (Q2436699) (← links)
- Counting inequivalent monotone Boolean functions. (Q2440095) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- A Boolean theory of signatures for tonal scales (Q2448914) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Boolean function metrics can assist modelers to check and choose logical rules (Q2670178) (← links)
- Joint realizability of monotone Boolean functions (Q2672606) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- A logic for binary classifiers and their explanation (Q2695522) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- SUPER-BOOLEAN FUNCTIONS AND FREE BOOLEAN QUASILATTICES (Q2875689) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks (Q2930802) (← links)
- Oblivious bounds on the probability of boolean functions (Q2943565) (← links)
- On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)