• Towards an Algorithmic Guide t...

Treffer: Towards an Algorithmic Guide to Spiral Galaxies

Title:
Towards an Algorithmic Guide to Spiral Galaxies
Authors:
Fertin, Guillaume, Jamshidi, Shahrad, Komusiewicz, Christian
Contributors:
Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS)
Source:
Theoretical Computer Science. :26-39
Publisher Information:
CCSD; Elsevier, 2015.
Publication Year:
2015
Collection:
collection:UNIV-NANTES
collection:CNRS
collection:LINA
collection:LINA-COMBI
collection:LS2N
collection:NANTES-UNIVERSITE
collection:UNIV-NANTES-AV2022
Subject Terms:
fixed-parameter algorithms, NP-hard problems, one-player game, [INFO.INFO-CC]Computer Science [cs], Computational Complexity [cs.CC]
Original Identifier:
HAL: hal-01159940
Document Type:
Zeitschrift article<br />Journal articles
Language:
English
ISSN:
0304-3975
1879-2294
Relation:
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.tcs.2015.01.051
DOI:
10.1016/j.tcs.2015.01.051
Access URL:
https://hal.science/hal-01159940
https://hal.science/hal-01159940v1/document
https://hal.science/hal-01159940v1/file/fun2014-journalversion.pdf
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.hal.01159940v1
Database:
HAL

Weitere Informationen

We study the one-player game Spiral Galaxies from an algorithmic viewpoint. Spiral Galaxies has been shown to be NP-hard [Friedman, 2002] more than a decade ago, but so far it seems that no one has dared exploring its algorithmic universe. We take this trip and visit some of its corners.