The following pages link to Formal Concept Analysis (Q5898505):
Displayed 8 items.
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Decision implication canonical basis: a logical perspective (Q743121) (← links)
- A depth-first search algorithm for computing pseudo-closed sets (Q1800382) (← links)
- Direct-optimal basis computation by means of the fusion of simplification rules (Q1800392) (← links)
- Some Complexity Results about Essential Closed Sets (Q3003410) (← links)
- Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods (Q3599207) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)