Some Complexity Results about Essential Closed Sets

DOI10.1007/978-3-642-20514-9_8zbMath1326.68283OpenAlexW1522338998MaRDI QIDQ3003410

Felix Distel

Publication date: 27 May 2011

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20514-9_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Cites Work

• On the complexity of enumerating pseudo-intents
• Attribute-incremental construction of the canonical implication basis
• Hardness of Enumerating Pseudo-intents in the Lectic Order
• Two Basic Algorithms in Concept Analysis
• Some Computational Problems Related to Pseudo-intents
• Formal Concept Analysis
• Formal Concept Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Complexity Results about Essential Closed Sets