Some Computational Problems Related to Pseudo-intents

DOI10.1007/978-3-642-01815-2_11MaRDI QIDQ3630240zbMATH OpenOpenAlexFDO

Authors Barış Sertkaya

Publication date 3 June 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-01815-2_11

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of enumerating pseudo-intents
• Formal Concept Analysis
• Hardness of enumerating pseudo-intents in the lectic order
• Some Notes on Pseudo-closed Sets
• Some complexity results about essential closed sets

Cited in

(10)

• A depth-first search algorithm for computing pseudo-closed sets
• Computing the Duquenne-Guigues basis: an algorithm for choosing the order
• Some complexity results about essential closed sets
• Hardness of enumerating pseudo-intents in the lectic order
• Succinctness and tractability of closure operator representations
• On the intractability of computing the Duquenne-Guigues base
• On the Complexity of Computing Generators of Closed Sets
• Formal Concept Analysis
• Mining ℰℒ⊥ Bases with Adaptable Role Depth
• On the complexity of enumerating pseudo-intents

This page was built for publication: Some Computational Problems Related to Pseudo-intents

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