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

scientific article

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

zbMath0753.90096MaRDI QIDQ3973044

Aviezri S. Fraenkel

Publication date: 26 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityTuring machineAnnihilation GamesGames with DrawsGeneralized Sprague-Grundy FunctionsNim-Like Gamessurvey of combinatorial games


Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial games (91A46) Turing machines and related notions (03D10)


Related Items

The complexity of pursuit on a graph




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3973044&oldid=12017420"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki