On the computational complexity and strategies of online Ramsey theory (Q322363)

From MaRDI portal
Revision as of 14:20, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the computational complexity and strategies of online Ramsey theory
scientific article

    Statements

    title
    On the computational complexity and strategies of online Ramsey theory (English)
    0 references
    author
    Pavel Dvořák
    0 references
    Tomáš Valla
    0 references
    publication date
    14 October 2016
    0 references
    zbMATH Keywords
    online Ramsey game
    0 references
    complexity
    0 references
    strategy
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C57
    0 references
    05D10
    0 references
    05C65
    0 references
    68Q17
    0 references
    91A43
    0 references
    zbMATH DE Number
    6639441
    0 references
    Wikidata QID
    Q57937802
    0 references
    OpenAlex ID
    W2175554205
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q322363&oldid=38304821"
    Powered by MediaWiki