On the complexity of enumerating pseudo-intents (Q628340): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About Keys of Formal Context and Conformal Hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Enumerating Pseudo-intents in the Lectic Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core of finite lattices / 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: Q4708957 / 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: New Results on Monotone Dualization and Generating Hypergraph Transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of monotone dualization: a brief survey / 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: Two Basic Algorithms in Concept Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Concept Analysis / 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: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Boolean dualization is in co-NP\([\log^{2}n]\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Enumeration Problems for Matroids / 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: Some decision and counting problems of the Duquenne-Guigues basis of implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / 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: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Notes on Pseudo-closed Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Computational Problems Related to Pseudo-intents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / 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: Q3952147 / rank
 
Normal rank

Latest revision as of 21:20, 3 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of enumerating pseudo-intents
scientific article

    Statements

    On the complexity of enumerating pseudo-intents (English)
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    0 references
    formal concept analysis
    0 references
    implications
    0 references
    Duquenne-Guigues base
    0 references
    pseudo-intents
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references