Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Scrabble is PSPACE-Complete
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2012 (English)Conference paper, Published paper (Refereed)
Abstract [en]

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, answeringan open question of Erik Demaine and Robert Hearn.

Place, publisher, year, edition, pages
2012. Vol. abs/1201.5298, 258-269 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7288
Keyword [en]
Scrabble, PSPACE-completeness, combinatorial games, computational complexity
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-112878DOI: 10.1007/978-3-642-30347-0_26Scopus ID: 2-s2.0-84861994938OAI: oai:DiVA.org:kth-112878DiVA: diva2:587535
Conference
6th International Conference on Fun with Algorithms, FUN 2012; Venice; Italy
Note

QC 20130502

Available from: 2013-01-14 Created: 2013-01-14 Last updated: 2013-09-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lampis, Michael
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 38 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf