Pages that link to "Item:Q5959738"
From MaRDI portal
The following pages link to On computing the size of a lattice and related decision problems (Q5959738):
Displayed 8 items.
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- Some decision and counting problems of the Duquenne-Guigues basis of implications (Q943835) (← links)
- Enumeration aspects of maximal cliques and bicliques (Q1028116) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- Horn representation of a concept lattice (Q3631392) (← links)
- Comparing performance of algorithms for generating concept lattices (Q4409026) (← links)
- On the Complexity of Computing Generators of Closed Sets (Q5445331) (← links)