A near-linear pseudopolynomial time algorithm for subset sum (Q4575810)
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 6904097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-linear pseudopolynomial time algorithm for subset sum |
scientific article; zbMATH DE number 6904097 |
Statements
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum (English)
0 references
16 July 2018
0 references
0.8816401958465576
0 references
0.8802193403244019
0 references
0.8567749857902527
0 references
0.8512609601020813
0 references
0.8392041325569153
0 references
