How many strings are easy to predict? (Q2566221)

From MaRDI portal
Revision as of 06:43, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
How many strings are easy to predict?
scientific article

    Statements

    title
    How many strings are easy to predict? (English)
    0 references
    author
    Yuri Kalnishkan
    0 references
    Vladimir Vovk
    0 references
    Michael V. Vyugin
    0 references
    publication date
    22 September 2005
    0 references
    zbMATH Keywords
    Kolmogorov complexity
    0 references

    Identifiers

    zbMATH DE Number
    2207401
    0 references
    Wikidata QID
    Q62046746
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2566221&oldid=15319677"
    Powered by MediaWiki