Parity games : descriptive complexity and algorithms for new solvers
Parity games are 2-person, 0-sum, graph-based, and determined games that form an important foundational concept in formal methods (see e.g., [Zie98]), and their exact computational complexity has been an open problem for over twenty years now. In this thesis, we study algorithms that solve parity ga...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Imperial College London
2013
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.579121 |