Florian+Jamain

a French chess player, 2012 TwixT world champion at the [|Mind Sports Olympiad] , computer scientist and mathematician with a Ph.D. in 2014 from Paris Dauphine University under Cristina Bazgan. His research interests include algorithms, [|computational complexity] and games. || toc =PSPACE-complete= Along with Edouard Bonnet and Abdallah Saffidine, Florian Jamain proved the [|connection games] Havannah and TwixT are [|PSPACE-complete], due to [|reduction] in encoding games already known to be PSPACE-complete into the target games. Hex could be encoded into TwixT, and [|Generalized geography] to Havannah.
 * Home * People * Florian Jamain**
 * [[image:FlorianJamain.jpg link="https://plus.google.com/113773293869956019695/about"]] ||~ || **Florian Jamain**,
 * Florian Jamain ||~ ||^ ||

=Selected Publications=
 * Edouard Bonnet, Florian Jamain, Abdallah Saffidine (**2013**). //[|Havannah and TwixT are PSPACE-complete]//. CG 2013
 * Edouard Bonnet, Florian Jamain, Abdallah Saffidine (**2013**). //On the Complexity of Trick-Taking Card Games//. [|IJCAI 2013]
 * Florian Jamain (**2014**). //Discrete representations of the nondominated set for multi-objective optimization problems//. ([|Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs]). Ph.D. thesis, Paris Dauphine University
 * Édouard Bonnet, Florian Jamain, Abdallah Saffidine (**2015**). //[|Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game]//. Advances in Computer Games 14
 * Édouard Bonnet, Florian Jamain, Abdallah Saffidine (**2016**). //On the Complexity of Connection Games//. [|arXiv:1605.04715]

=External Links=
 * [|Florian Jamain - Google+]
 * [|Jamain, Florian FIDE Chess Profile]

=References= =What links here?= include page="Florian Jamain" component="backlinks" limit="40"
 * Up one level**