Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Mario Kart Is Hard

From MaRDI portal
Publication:2958086
Jump to:navigation, search

DOI10.1007/978-3-319-48532-4_5zbMath1425.68131OpenAlexW2551241490MaRDI QIDQ2958086

Jeffrey Bosboom, Erik D. Demaine, Jayson Lynch, Erik Waingarten, Adam Hesterberg

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_5


Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)


Related Items

Backgammon is hard, The complexity of speedrunning video games, Cooperating in video games? Impossible! Undecidability of team multiplayer games, Twenty years of progress of \(\mathrm{JCDCG}^3\)



Cites Work

  • Gaming is a hard job, but someone has to do it!
  • A better heuristic for orthogonal graph drawings
  • Classic Nintendo games are (computationally) hard
  • Computational Complexity of Two-Dimensional Platform Games
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2958086&oldid=15953643"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki