A Bound on the Shannon Capacity via a Linear Programming Variation (Q4584958): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129282069, #quickstatements; #temporary_batch_1726270021205 |
||
| (One intermediate revision by one other user not shown) | |||
| 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
5 September 2018
0 references
Shannon capacity
0 references
linear programming
0 references
index coding
0 references
