Pages that link to "Item:Q2838941"
From MaRDI portal
The following pages link to On the complexity of the dualization problem (Q2838941):
Displaying 14 items.
- Construction of irredundant coverings of a Boolean matrix (Q492423) (← links)
- Dualization in lattices given by ordered sets of irreducibles (Q507520) (← links)
- On the complexity of discrete generation problems (Q542310) (← links)
- Polynomial-delay construction of irreducible coverings of a Boolean matrix (Q960711) (← links)
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function (Q1327236) (← links)
- Problems, models and complexity. II: Application to the DLSP (Q1405821) (← links)
- Dualization problem over the product of chains: asymptotic estimates for the number of solutions (Q1732054) (← links)
- Finding maximal independent elements of products of partial orders (the case of chains) (Q2319829) (← links)
- Asymptotically optimal dualization algorithms (Q2354515) (← links)
- Asymptotic estimates for the number of solutions of the dualization problem and its generalizations (Q2898206) (← links)
- (Q3035160) (← links)
- The Big Mother of all Dualities: Möller Algorithm (Q4801395) (← links)
- (Q5150622) (← links)
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540) (← links)