Pages that link to "Item:Q3837390"
From MaRDI portal
The following pages link to On the Complexity of Dualization of Monotone Disjunctive Normal Forms (Q3837390):
Displaying 50 items.
- Fast, flexible MUS enumeration (Q272009) (← links)
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- Inverse subsumption for complete explanatory induction (Q439023) (← links)
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets (Q444438) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- RQL: a query language for rule discovery in databases (Q507529) (← links)
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- A study on monotone self-dual Boolean functions (Q523743) (← 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)
- Tropical polar cones, hypergraph transversals, and mean payoff games (Q550656) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- On a cone covering problem (Q617540) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions (Q646712) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- A note on systems with max-min and max-product constraints (Q835215) (← links)
- Minimum implicational basis for \(\wedge\)-semidistributive lattices (Q845722) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← 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)
- Stability of two player game structures (Q948685) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Minimal and locally minimal games and game forms (Q1043974) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- Interior and exterior functions of positive Boolean functions. (Q1408452) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- On necessary and sufficient conditions for solvability of game forms. (Q1421920) (← links)
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms (Q1659991) (← links)
