Realizability of greedy algorithms (Q643840)
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 5966634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realizability of greedy algorithms |
scientific article; zbMATH DE number 5966634 |
Statements
Realizability of greedy algorithms (English)
0 references
2 November 2011
0 references
best \(m\)-term approximation
0 references
greedy algorithms
0 references
category
0 references
0.8129891753196716
0 references
0.810152530670166
0 references
0.8099141716957092
0 references
0.7973895072937012
0 references
0.7930801510810852
0 references
