Some complexity results about packet radio networks (Corresp.) (Q3342476)
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: Some complexity results about packet radio networks (Corresp.) |
scientific article; zbMATH DE number 3875166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some complexity results about packet radio networks (Corresp.) |
scientific article; zbMATH DE number 3875166 |
Statements
Some complexity results about packet radio networks (Corresp.) (English)
0 references
1984
0 references
packet radio network
0 references
nondeterministic polynomial time hard
0 references
capacity region
0 references
0.760010302066803
0 references
0.7478819489479065
0 references
0.7459157705307007
0 references
0.7443642616271973
0 references
0.7443400025367737
0 references
