« Back to Record
Citation APA

Brenguier, R., Raskin, J.-F., & Sassolas, M. (2014). The complexity of admissibility in Omega-regular games. Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (p. 23).


Permalink

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/188938

Brenguier, R., Raskin, J.-F., & Sassolas, M. (2014). The complexity of admissibility in Omega-regular games. Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (p. 23).