Classic Nintendo games are (computationally) hard

标题
Classic Nintendo games are (computationally) hard
作者
关键词
Nintendo games, Video games, Computational complexity, NP-hardness, PSPACE-hardness
出版物
THEORETICAL COMPUTER SCIENCE
Volume 586, Issue -, Pages 135-160
出版商
Elsevier BV
发表日期
2015-02-27
DOI
10.1016/j.tcs.2015.02.037

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started