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 17 items.
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (Q425555) (← links)
- A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections (Q527183) (← links)
- Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (Q781866) (← 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)
- Intrinsic dimension estimation based on local adjacency information (Q2127086) (← links)
- A general theory of concept lattice with tractable implication exploration (Q2193284) (← links)
- On the size of \(\exists \)-generalized concept lattices (Q2286401) (← links)
- On computing the Galois lattice of bipartite distance hereditary graphs (Q2357768) (← links)
- A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895) (← 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)
- On formal concepts of random formal contexts (Q6089963) (← links)
- Concept and attribute reduction based on rectangle theory of formal concept (Q6167852) (← links)