Succinctness and tractability of closure operator representations (Q507522): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2219393927 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q54824445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition method for CNF minimality proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of databases and closure operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting of Moore Families for n=7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS / 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: Q3349969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5058462 / 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: Lattices of closure operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: Minimum Covers in Relational Database Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / 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 Notes on Managing Closure Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Succinctness of Closure Operator Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Computational Problems Related to Pseudo-intents / rank
 
Normal rank

Latest revision as of 09:58, 13 July 2024

scientific article
Language Label Description Also known as
English
Succinctness and tractability of closure operator representations
scientific article

    Statements

    Succinctness and tractability of closure operator representations (English)
    0 references
    0 references
    6 February 2017
    0 references
    closure operators
    0 references
    formal contexts
    0 references
    implications
    0 references
    tractability
    0 references
    succinctness
    0 references
    computational properties
    0 references

    Identifiers