_[1203.1895] Classic Nintendo Games are (NP-)Hard : Subjects: Computational Complexity (cs.CC); Computer Science and Game Theory (cs.GT) : Greg Aloupis, Erik D. Demaine, Alan Guo : Cornell University Library

game

nilab のブックマーク 2012/03/17 13:52

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/84544573/comment/nilab" data-user-id="nilab" data-entry-url="https://b.hatena.ne.jp/entry/s/arxiv.org/abs/1203.1895" data-original-href="https://arxiv.org/abs/1203.1895" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Farxiv.org%2Fabs%2F1203.1895" data-user-icon="/users/nilab/profile.png">Classic Nintendo Games are (Computationally) Hard</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/game">game</a>]</li></ul><br><p style="clear: left">_[1203.1895] Classic Nintendo Games are (NP-)Hard : Subjects:  Computational Complexity (cs.CC); Computer Science and Game Theory (cs.GT) : Greg Aloupis, Erik D. Demaine, Alan Guo : Cornell University Library</p><a class="datetime" href="https://b.hatena.ne.jp/nilab/20120317#bookmark-84544573"><span class="datetime-body">2012/03/17 13:52</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！

Classic Nintendo Games are (Computationally) Hard

arxiv.org2012/03/09

We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. Our results apply to generalized versions of Super Mari...

19 人がブックマーク・7 件のコメント

他のコメントを読む

＼コメントがサクサク読めるアプリです／

はてなブックマーク

Classic Nintendo Games are (Computationally) Hard

はてなブックマーク

公式Twitter

はてなのサービス