Pages that link to "Item:Q3552284"
From MaRDI portal
The following pages link to Hardness of Enumerating Pseudo-intents in the Lectic Order (Q3552284):
Displayed 6 items.
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Formal Methods in FCA and Big Data (Q5054986) (← links)