On the Complexity of Parity Games - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Arnold Beckmann' in GoogleThis author has not been identified. Look up 'Faron Moller' in Google

runs on WebDSL