Mathematical Foundations of Computer Science 2003
From MaRDI portal
(Redirected from Publication:5431341)
Mathematical Foundations of Computer Science 2003 (scientific article; zbMATH DE number 5218857)
Mathematical Foundations of Computer Science 2003 (scientific article; zbMATH DE number 5218857)
Recommendations
- PSPACE-Hardness of some combinatorial games
- On sabotage games
- The game total domination problem is log-complete in PSPACE
- Solving counter parity games
- Solving parity games in big steps
- Solving Parity Games in Big Steps
- The complexity of reachability in randomized sabotage games
- Bust-a-Move/Puzzle Bobble is NP-complete
- Solving parity games in practice
Cited in
(18)- On sabotage games
- Complexity of question/answer games
- The modal logic of copy and remove
- A game theoretic approach to the analysis of dynamic networks
- The complexity of reachability in randomized sabotage games
- Sabotage modal logic: some model and proof theoretic aspects
- Connectivity games over dynamic networks
- Moving in a network under random failures: a complexity analysis
- Modal logics of sabotage revisited
- THE MODAL LOGIC OF STEPWISE REMOVAL
- Quantitative games under failures
- Copy and remove as dynamic operators
- Foundations of Software Science and Computation Structures
- The modal logics of the poison game
- Solution complexity of local variants of sabotage game
- A formal approach to attack graphs
- An algorithmic analysis of the Honey-Bee game
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
This page was built for publication: Mathematical Foundations of Computer Science 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5431341)