On links between concept lattices and related complexity problems

DOI10.1007/978-3-642-11928-6_10MaRDI QIDQ3552285zbMATH OpenOpenAlexFDO

Authors Mikhail A. Babin, Sergei O. Kuznetsov

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_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Complete lattices, completions (06B23)

Recommendations

• On computing the size of a lattice and related decision problems
• Two basic algorithms in concept analysis
• On homogeneousL-bonds and heterogeneousL-bonds
• Mathematical aspects of concept analysis
• scientific article; zbMATH DE number 877297

Cited in

(8)

• scientific article; zbMATH DE number 5557951 (Why is no real title available?)
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• scientific article; zbMATH DE number 90538 (Why is no real title available?)
• Preface to the special issue on ``Concept lattice and their applications (CLA-2011)
• On the \(n\)-ary generalization of dual bonds
• Connecting concept lattices with bonds induced by external information
• Upper Bound for the Number of Concepts of Contranominal-Scale Free Contexts
• On computing the size of a lattice and related decision problems

This page was built for publication: On links between concept lattices and related complexity problems

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