Evènement pour le groupe Modélisation et Verification

Date 2013-01-17  11:30-12:30
TitreBeautiful Games You Cannot Stop Playing 
RésuméParity games are simple two player games played on a finite arena that have all that it takes to attract the attention of researchers: it is a simple problem which is hard to analyse. A pocket version of P vs. NP. Parity games are known to be in UP, CoUP, and some weirder classes besides, but whether or not they are in P has proven to be a rather elusive question. What is more, when you work with them, you will have the constant feeling that there is a polynomial time solution just around the corner, although it dissolves into nothingness when you look more closely. This talk is about the beauty of these games, the relevant algorithmic approaches and their complexity and development over time. But be careful: they are addictive, don't get hooked!  
OrateurSven Schewe 
UrlUniv. Liverpool 

Aucun document lié à cet événement.

Retour à l'index