Solving the sabotage game is PSPACE-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2747, Issue , 2003, Pages 531-540

  Löding, Christof ^a   Rohde, Philipp ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING;

COMPLETE SEARCH; HAMILTON PATH; MODAL LOGIC; MULTIGRAPHS; PSPACE-COMPLETE; REACHABILITY; SABOTAGE GAMES; WINNING CONDITIONS;

CRIME;

EID: 33745794746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_47     Document Type: Article

References (4)

1. van Benthem, J.: An essay on sabotage and obstruction. In Hutter, D., Werner, S., eds.: Festschrift in Honour of Prof. Jörg Siekmann. LNAI. Springer (2002)
2. Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Proceedings of MFCS 2001. Volume 2136 of LNCS., Springer (2001) 18-32
3. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
4. Löding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. Technical Report AIB-05-2003, RWTH Aachen (2003)