Network encoding complexity: exact values, bounds, and inequalities (Q2408285)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Network encoding complexity: exact values, bounds, and inequalities |
scientific article; zbMATH DE number 6790138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network encoding complexity: exact values, bounds, and inequalities |
scientific article; zbMATH DE number 6790138 |
Statements
Network encoding complexity: exact values, bounds, and inequalities (English)
0 references
12 October 2017
0 references
Menger's path
0 references
network coding
0 references
encoding complexity
0 references
multicast network
0 references
multiple unicast network
0 references
0.7665692567825317
0 references
0.7592213749885559
0 references
0.7183500528335571
0 references
0.6946637034416199
0 references
0.6894536018371582
0 references
