A unified way of analyzing some greedy algorithms (Q2329295)
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 unified way of analyzing some greedy algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A unified way of analyzing some greedy algorithms |
scientific article |
Statements
A unified way of analyzing some greedy algorithms (English)
0 references
17 October 2019
0 references
Banach space
0 references
greedy approximation
0 references
greedy algorithm
0 references
weak biorthogonal greedy algorithm
0 references
0.8025175929069519
0 references
0.7979742884635925
0 references
0.7969810366630554
0 references
0.792588472366333
0 references
0.7906432747840881
0 references
