Pages that link to "Item:Q2449091"

The following pages link to Efficient algorithms for dualizing large-scale hypergraphs (Q2449091):

Displaying 18 items.

• The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
• Discovery of the \(D\)-basis in binary tables based on hypergraph dualization (Q507518) (← links)
• RQL: a query language for rule discovery in databases (Q507529) (← links)
• Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
• Optimal resource allocation enables mathematical exploration of microbial metabolic configurations (Q1679003) (← links)
• Enumerating models of DNF faster: breaking the dependency on the formula size (Q1983134) (← links)
• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• On the logical analysis of partially ordered data in the supervised classification problem (Q2284267) (← links)
• Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
• Asymptotically optimal dualization algorithms (Q2354515) (← links)
• An average study of hypergraphs and their minimal transversals (Q2355712) (← links)
• One approach to decoding monotone logical function (Q2689579) (← links)
• The Minimal Hitting Set Generation Problem: Algorithms and Computation (Q2953406) (← links)
• Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
• Embedding Dimension of a Good Semigroup (Q5115898) (← links)
• Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies (Q5255648) (← links)
• Implementing Efficient All Solutions SAT Solvers (Q5266602) (← links)
• Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)