Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085397962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected edge geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / 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: Parameterized Chess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pursuit-evasion games / rank
 
Normal rank

Latest revision as of 05:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
scientific article

    Statements

    Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (English)
    0 references
    0 references
    13 January 2014
    0 references
    algorithmic combinatorial game theory
    0 references
    completeness in polynomial space
    0 references
    hardness in fixed parameter computation
    0 references

    Identifiers