A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513)
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 7614561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for solving the hidden subset sum problem |
scientific article; zbMATH DE number 7614561 |
Statements
A polynomial-time algorithm for solving the hidden subset sum problem (English)
0 references
9 November 2022
0 references
Nguyen-Stern algorithm
0 references
lattice based algorithm
0 references
0 references
0.7684659361839294
0 references
0.7684659361839294
0 references
0.7659444212913513
0 references
