A depth-first search algorithm for computing pseudo-closed sets (Q1800382): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.03.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2786028510 / 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: Computing the Duquenne–Guigues basis: an algorithm for choosing the order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for \(k\)-meet-semidistributive lattices / 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: Q5789040 / 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: The core of finite lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all closed sets: A general approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5058462 / 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: Q5429564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute-incremental construction of the canonical implication basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal implicational bases for finite modular lattices / rank
 
Normal rank

Latest revision as of 02:00, 17 July 2024

scientific article
Language Label Description Also known as
English
A depth-first search algorithm for computing pseudo-closed sets
scientific article

    Statements

    A depth-first search algorithm for computing pseudo-closed sets (English)
    0 references
    0 references
    23 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    implication
    0 references
    pseudo-closed set
    0 references
    0 references