Pages that link to "Item:Q1961461"
From MaRDI portal
The following pages link to On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461):
Displaying 39 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets (Q444438) (← links)
- Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames (Q524983) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- On fuzzy relational equations and the covering problem (Q545381) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Stability of two player game structures (Q948685) (← links)
- On the relation between fuzzy max-Archimedean t-norm relational equations and the covering problem (Q1040915) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- On necessary and sufficient conditions for solvability of game forms. (Q1421920) (← links)
- Optimal resource allocation enables mathematical exploration of microbial metabolic configurations (Q1679003) (← links)
- Monotone bargaining is Nash-solvable (Q1801037) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- Isotone lattice-valued Boolean functions and cuts (Q2834200) (← links)
- On the complexity of the dualization problem (Q2838941) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames (Q3503628) (← links)
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
- Generating dual-bounded hypergraphs (Q4405941) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
- (Q5140714) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- On Dualization over Distributive Lattices (Q6045449) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms (Q6150959) (← links)
