Skip to main content
SpringerLink
Log in

On a greedy algorithm in the space L p [0, 1]

  • Short Communications
  • Published:
Mathematical Notes Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. K. Jones, Ann. Statist. 20(1), 608 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  2. E. D. Livshits, Mat. Zametki 73(3), 371 (2003) [Math. Notes 73 (3–4), 342 (2003)].

    MathSciNet  Google Scholar 

  3. M. Ganichev and N. J. Kalton, J. Approx. Theory 124(1), 89 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  4. T. P. Lukashenko, Vestnik Moskov. Univ. Ser. I Mat. Mekh., No. 1, 6 (2001) [Moscow Univ. Math. Bull. 56 (1), 5 (2001)].

  5. V. N. Temlyakov, Acta Numer. 17, 235 (2008).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Evernote Corp., Moscow, Russia

    E. D. Livshits

Authors
  1. E. D. Livshits
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. D. Livshits.

Additional information

Original Russian Text © E. D. Livshits, 2009, published in Matematicheskie Zametki, 2009, Vol. 85, No. 5, pp. 788–791.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Livshits, E.D. On a greedy algorithm in the space L p [0, 1]. Math Notes 85, 751–754 (2009). https://doi.org/10.1134/S0001434609050162

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434609050162

Key words

Search

Navigation