Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases (Q2688668)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
scientific article

    Statements

    Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases (English)
    0 references
    0 references
    0 references
    3 March 2023
    0 references
    bases
    0 references
    Markushevich
    0 references
    semi-greedy
    0 references
    almost greedy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references