Pages that link to "Item:Q492423"
From MaRDI portal
The following pages link to Construction of irredundant coverings of a Boolean matrix (Q492423):
Displaying 6 items.
- On the complexity of discrete generation problems (Q542310) (← links)
- Polynomial-delay construction of irreducible coverings of a Boolean matrix (Q960711) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- Boolean matrices and their applications to covering reductions (Q2805475) (← links)
- On the complexity of the dualization problem (Q2838941) (← links)
- (Q3970833) (← links)