Hardness of enumerating pseudo-intents in the lectic order

DOI10.1007/978-3-642-11928-6_9MaRDI QIDQ3552284zbMATH OpenOpenAlexFDO

Authors Felix Distel

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)

Recommendations

• On the complexity of enumerating pseudo-intents
• Some Computational Problems Related to Pseudo-intents
• Some complexity results about essential closed sets
• Formal Concept Analysis
• Some Notes on Pseudo-closed Sets

Cited in

(8)

• Fast algorithms for implication bases and attribute exploration using proper premises
• Some Computational Problems Related to Pseudo-intents
• Formal Methods in FCA and Big Data
• Formal Concept Analysis
• Some complexity results about essential closed sets
• A general theory of concept lattice with tractable implication exploration
• Succinctness and tractability of closure operator representations
• On the complexity of enumerating pseudo-intents

This page was built for publication: Hardness of enumerating pseudo-intents in the lectic order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552284)