The guarding game is E-complete (Q389949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Robert Šámal / rank
 
Normal rank
Property / author
 
Property / author: Tomáš Valla / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A43 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A24 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6248970 / rank
 
Normal rank
Property / zbMATH Keywords
 
pursuit game
Property / zbMATH Keywords: pursuit game / rank
 
Normal rank
Property / zbMATH Keywords
 
cops-and-robber game
Property / zbMATH Keywords: cops-and-robber game / rank
 
Normal rank
Property / zbMATH Keywords
 
graph guarding game
Property / zbMATH Keywords: graph guarding game / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
E-completeness
Property / zbMATH Keywords: E-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
games on propositional formulas
Property / zbMATH Keywords: games on propositional formulas / rank
 
Normal rank

Revision as of 14:49, 29 June 2023

scientific article
Language Label Description Also known as
English
The guarding game is E-complete
scientific article

    Statements

    The guarding game is E-complete (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    pursuit game
    0 references
    cops-and-robber game
    0 references
    graph guarding game
    0 references
    computational complexity
    0 references
    E-completeness
    0 references
    games on propositional formulas
    0 references