Pages that link to "Item:Q628340"
From MaRDI portal
The following pages link to On the complexity of enumerating pseudo-intents (Q628340):
Displayed 4 items.
- Optimizations in computing the Duquenne-Guigues basis of implications (Q2248528) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Measuring the Implications of the D-Basis in Analysis of Data in Biomedical Studies (Q5255648) (← links)