A faster pseudopolynomial time algorithm for subset sum (Q4575809)
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: A faster pseudopolynomial time algorithm for subset sum |
scientific article; zbMATH DE number 6904096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster pseudopolynomial time algorithm for subset sum |
scientific article; zbMATH DE number 6904096 |
Statements
A Faster Pseudopolynomial Time Algorithm for Subset Sum (English)
0 references
16 July 2018
0 references
0.9217954277992249
0 references
0.8816401958465576
0 references
0.841781497001648
0 references
0.8085200786590576
0 references
0.807192325592041
0 references
