Pages that link to "Item:Q943839"

The following pages link to Computational aspects of monotone dualization: a brief survey (Q943839):

Displaying 49 items.

• An algorithm for solving parametric integer program (Q324821) (← links)
• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
• Counting or producing all fixed cardinality transversals (Q472469) (← links)
• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
• Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
• A study on monotone self-dual Boolean functions (Q523743) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• On the complexity of enumerating pseudo-intents (Q628340) (← 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)
• Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
• Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
• Influence decision models: from cooperative game theory to social network analysis (Q826316) (← links)
• Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
• On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
• On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
• Multiple hypernode hitting sets and smallest two-cores with targets (Q1041434) (← links)
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations (Q1679003) (← links)
• Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
• A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
• An algebraic algorithm for solving parametric integer programs (Q1752503) (← links)
• Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
• On the dualization in distributive lattices and related problems (Q2030249) (← links)
• Translating between the representations of a ranked convex geometry (Q2032718) (← links)
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
• Semantic forgetting in answer set programming (Q2389674) (← links)
• Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
• Computing the output distribution and selection probabilities of a stack filter from the DNF of its positive Boolean function (Q2513325) (← links)
• The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
• Counting Minimal Dominating Sets (Q2988832) (← links)
• Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
• Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction (Q3638844) (← links)
• Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
• (Q5092436) (← links)
• (Q5140714) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)
• Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
• Dualization in lattices given by implicational bases (Q5919405) (← links)
• Multidimension: a dimensionality extension of simple games (Q6060715) (← links)
• Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
• On the generalized dimension and codimension of simple games (Q6106512) (← links)
• Lattice structures that parameterize regulatory network dynamics (Q6594600) (← links)
• Generating minimal redundant and maximal irredundant subhypergraphs (Q6611070) (← links)
• New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)