A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem (Q5387809)
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 5279496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem |
scientific article; zbMATH DE number 5279496 |
Statements
A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem (English)
0 references
27 May 2008
0 references
0 references
0.8917126655578613
0 references
0.828879177570343
0 references
0.8281258940696716
0 references
0.8230262994766235
0 references
0.8227761387825012
0 references
