Covert Communication With Polynomial Computational Complexity (Q5123791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7253145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covert Communication With Polynomial Computational Complexity |
scientific article; zbMATH DE number 7253145 |
Statements
Covert Communication With Polynomial Computational Complexity (English)
0 references
29 September 2020
0 references
