Infinite vs. finite size-bounded randomized computations (Q2637645)

From MaRDI portal
Revision as of 08:06, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Infinite vs. finite size-bounded randomized computations
scientific article

    Statements

    title
    Infinite vs. finite size-bounded randomized computations (English)
    0 references
    author
    Richard Královič
    0 references
    publication date
    13 February 2014
    0 references
    zbMATH Keywords
    probabilistic computations
    0 references
    Las Vegas randomization
    0 references
    time complexity
    0 references
    size complexity
    0 references
    rotating finite automata
    0 references
    sweeping finite automata
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q87
    0 references
    68Q45
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6257465
    0 references
    OpenAlex ID
    W2047009604
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2637645&oldid=35373049"
    Powered by MediaWiki