A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481)
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 1542286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. |
scientific article; zbMATH DE number 1542286 |
Statements
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (English)
0 references
12 December 2000
0 references
Computational complexity
0 references
Collapse
0 references
General Cook reduction
0 references
Lattice
0 references
0 references
0 references
0.8384798169136047
0 references
0.8365167379379272
0 references
0.8333910703659058
0 references
0.8288744688034058
0 references
