On computing the size of a lattice and related decision problems
From MaRDI portal
Publication:5959738
DOI10.1023/A:1013970520933zbMath0991.06006OpenAlexW277700758MaRDI QIDQ5959738
Publication date: 11 April 2002
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013970520933
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Lattices (06B99)
Related Items (17)
On computing the Galois lattice of bipartite distance hereditary graphs ⋮ Complexity of learning in concept lattices from positive and negative examples ⋮ Intrinsic dimension estimation based on local adjacency information ⋮ On formal concepts of random formal contexts ⋮ A general theory of concept lattice with tractable implication exploration ⋮ Concept and attribute reduction based on rectangle theory of formal concept ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ A convexity upper bound for the number of maximal bicliques of a bipartite graph ⋮ Some decision and counting problems of the Duquenne-Guigues basis of implications ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ Comparing performance of algorithms for generating concept lattices ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ Horn representation of a concept lattice ⋮ Enumeration aspects of maximal cliques and bicliques ⋮ Handling high dimensionality contexts in formal concept analysis via binary decision diagrams
This page was built for publication: On computing the size of a lattice and related decision problems
