Classic Nintendo games are (computationally) hard-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Classic Nintendo games are (computationally) hard

Published:2015-06 Issue: Volume:586 Page:135-160
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Aloupis Greg,Demaine Erik D.,Guo Alan,Viglietta Giovanni

Funder

NSF

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference7 articles.

1. The hardness of the Lemmings game, or Oh no, more NP-completeness proofs;Cormode,2004

2. PushPush and Push-1 are NP-hard in 2D;Demaine,2000

3. PushPush-k is PSPACE-complete;Demaine,2004

4. Computational complexity of two-dimensional platform games;Forišek,2010

5. Gaming is a hard job, but someone has to do it!;Viglietta;Theory Comput. Syst.,2014

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. CoplayingVR: Understanding User Experience in Shared Control in Virtual Reality;Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies;2024-08-22

2. Damage Optimization in Video Games: A Player-Driven Co-Creative Approach;Proceedings of the CHI Conference on Human Factors in Computing Systems;2024-05-11

3. PairPlayVR: Shared Hand Control for Virtual Games;Proceedings of the Augmented Humans International Conference 2024;2024-04-04

4. Universal Generation for Optimality Theory Is PSPACE-Complete;Computational Linguistics;2024-01-15

5. Using Evolutionary Algorithms to Target Complexity Levels in Game Economies;IEEE Transactions on Games;2023-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP