Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| label / en | label / en | ||
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2399135883 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1806.04087 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2913823 / rank | |||
Normal rank | |||
| Property / title | |||
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (English) | |||
| Property / title: Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (English) / rank | |||
Normal rank | |||
Latest revision as of 09:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors |
scientific article |
Statements
27 September 2012
0 references
lattices
0 references
shortest vector problem
0 references
NP-hardness
0 references
hardness of approximation
0 references
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (English)
0 references
