LAMSADE, Université Paris Dauphine
JST Erato Minato Discrete Structure Manipulation System Project
University College London
(compatible with EndNote, Reference Manager, ProCite, RefWorks)
(compatible with BibDesk, LaTeX)
In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACE-completeness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn.
Already have an account? Login in here