Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward (Q4566607)
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 6895579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward |
scientific article; zbMATH DE number 6895579 |
Statements
Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward (English)
0 references
27 June 2018
0 references
