On the Complexity of Parity Games

Arnold Beckmann, Faron Moller. On the Complexity of Parity Games. In Erol Gelenbe, Samson Abramsky, Vladimiro Sassone, editors, Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008. pages 237-248, British Computer Society, 2008. [doi]

Abstract

Abstract is missing.