Fredman–Komlós bounds and information theory (Q3739153): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4068740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-step encoding for finite sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156696 / rank
 
Normal rank

Latest revision as of 16:04, 17 June 2024

scientific article
Language Label Description Also known as
English
Fredman–Komlós bounds and information theory
scientific article

    Statements

    Fredman–Komlós bounds and information theory (English)
    0 references
    0 references
    1986
    0 references
    perfect hashing
    0 references
    graph covering
    0 references
    graph entropy
    0 references
    Fredman-Komlós lemma
    0 references
    entropies of graphs
    0 references
    separating partition systems
    0 references

    Identifiers

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