Some Computational Problems Related to Pseudo-intents
From MaRDI portal
Publication:3630240
DOI10.1007/978-3-642-01815-2_11zbMath1248.68483OpenAlexW1520556001MaRDI QIDQ3630240
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
Related Items (4)
Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ On the complexity of enumerating pseudo-intents ⋮ Some Complexity Results about Essential Closed Sets ⋮ Succinctness and tractability of closure operator representations
This page was built for publication: Some Computational Problems Related to Pseudo-intents