License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2018.8
URN: urn:nbn:de:0030-drops-89015
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8901/
Benesh, Bret ;
Carter, Jamylle ;
Coleman, Deidra A. ;
Crabill, Douglas G. ;
Good, Jack H. ;
Smith, Michael A. ;
Travis, Jennifer ;
Ward, Mark Daniel
Periods in Subtraction Games (Keynote Speakers)
Abstract
We discuss the structure of periods in subtraction games. In particular, we discuss ways that a computational approach yields insights to the periods that emerge in the asymptotic structure of these combinatorial games.
BibTeX - Entry
@InProceedings{benesh_et_al:LIPIcs:2018:8901,
author = {Bret Benesh and Jamylle Carter and Deidra A. Coleman and Douglas G. Crabill and Jack H. Good and Michael A. Smith and Jennifer Travis and Mark Daniel Ward},
title = {{Periods in Subtraction Games (Keynote Speakers)}},
booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)},
pages = {8:1--8:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-078-1},
ISSN = {1868-8969},
year = {2018},
volume = {110},
editor = {James Allen Fill and Mark Daniel Ward},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8901},
URN = {urn:nbn:de:0030-drops-89015},
doi = {10.4230/LIPIcs.AofA.2018.8},
annote = {Keywords: combinatorial games, subtraction games, periods, asymptotic structure}
}
Keywords: |
|
combinatorial games, subtraction games, periods, asymptotic structure |
Collection: |
|
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
18.06.2018 |