Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time (Q3768395)

From MaRDI portal
Revision as of 00:03, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time
scientific article

    Statements

    Some combinatorial game problems require Ω( <i> n <sup>k</sup> </i> ) time (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    complexity classes
    0 references
    k-pebble game problem
    0 references
    deterministic polynomial time
    0 references
    polynomial-time lower bounds
    0 references

    Identifiers