Hardness of Enumerating Pseudo-intents in the Lectic Order
From MaRDI portal
Publication:3552284
DOI10.1007/978-3-642-11928-6_9zbMath1274.68480OpenAlexW1555112619MaRDI QIDQ3552284
Publication date: 14 April 2010
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11928-6_9
Exact enumeration problems, generating functions (05A15) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Formal Methods in FCA and Big Data ⋮ A general theory of concept lattice with tractable implication exploration ⋮ On the complexity of enumerating pseudo-intents ⋮ Some Complexity Results about Essential Closed Sets ⋮ Succinctness and tractability of closure operator representations ⋮ Fast algorithms for implication bases and attribute exploration using proper premises