Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision algorithms for multiplayer noncooperative games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and the Existence of Complexity Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation bounded auxiliary pushdown automata / rank
 
Normal rank

Revision as of 20:17, 3 June 2024

scientific article; zbMATH DE number 1671989
Language Label Description Also known as
English
Lower bounds for multiplayer noncooperative games of incomplete information
scientific article; zbMATH DE number 1671989

    Statements

    Lower bounds for multiplayer noncooperative games of incomplete information (English)
    0 references
    12 November 2001
    0 references
    alternation
    0 references
    algorithms
    0 references
    complexity theory
    0 references
    game theory
    0 references
    incomplete information
    0 references
    blindfold
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references