Algorithms for \(k\)-meet-semidistributive lattices (Q507534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.10.029 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03G10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06D75 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6680941 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-meet-semidistributive lattice
Property / zbMATH Keywords: \(k\)-meet-semidistributive lattice / rank
 
Normal rank
Property / zbMATH Keywords
 
colored poset
Property / zbMATH Keywords: colored poset / rank
 
Normal rank
Property / zbMATH Keywords
 
implicational base
Property / zbMATH Keywords: implicational base / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1869935947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implicational bases of closure systems with unique critical sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovery of the \(D\)-basis in binary tables based on hypergraph dualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered direct implicational basis of a finite closure system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing premises of a minimal cover of functional dependencies is intractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Armstrong Relations for Functional Dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple facets of the canonical direct unit implicational basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5841991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubling convex sets in lattices and a generalized semidistributivity condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of enumerating pseudo-intents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying the Minimal Transversals of a Hypergraph and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing semidistributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Moore families on \(n=6\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum implicational basis for \(\wedge\)-semidistributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all maximal models of a Boolean expression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design by example: An application of Armstrong relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for implication bases and attribute exploration using proper premises / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimum cover of functional dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The joy of implications, aka pure Horn formulas: mainly a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal implicational bases for finite modular lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdirect decomposition of concept lattices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.10.029 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:52, 9 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for \(k\)-meet-semidistributive lattices
scientific article

    Statements

    Algorithms for \(k\)-meet-semidistributive lattices (English)
    0 references
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    \(k\)-meet-semidistributive lattice
    0 references
    colored poset
    0 references
    implicational base
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references