Solving random subset sum problem by \(l_p\)-norm SVP oracle (Q5402983)
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: Solving random subset sum problem by l_p-norm SVP oracle |
scientific article; zbMATH DE number 6273709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving random subset sum problem by \(l_p\)-norm SVP oracle |
scientific article; zbMATH DE number 6273709 |
Statements
Solving Random Subset Sum Problem by l p -norm SVP Oracle (English)
0 references
25 March 2014
0 references
SVP
0 references
random subset sum problems
0 references
lattice
0 references
\(l_p\)-norm
0 references
0.8657444715499878
0 references
0.7969775199890137
0 references
0.7880671620368958
0 references
