A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129282069, #quickstatements; #temporary_batch_1726270021205
 
(3 intermediate revisions by 3 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1804.05529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Coding With Side Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local chromatic number and Sperner capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Index Coding Outperforming the Linear Optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of C. E. Shannon in Graph Theory / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099089427 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129282069 / rank
 
Normal rank

Latest revision as of 00:31, 14 September 2024

scientific article; zbMATH DE number 6932146
Language Label Description Also known as
English
A Bound on the Shannon Capacity via a Linear Programming Variation
scientific article; zbMATH DE number 6932146

    Statements

    A Bound on the Shannon Capacity via a Linear Programming Variation (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2018
    0 references
    Shannon capacity
    0 references
    linear programming
    0 references
    index coding
    0 references

    Identifiers

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