Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2021.57
URN: urn:nbn:de:0030-drops-137020
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13702/
Rahman, Md Lutfar ; Watson, Thomas
6-Uniform Maker-Breaker Game Is PSPACE-Complete
| pdf-format: |
|
Abstract
In a STOC 1976 paper, Schaefer proved that it is PSPACE-complete to determine the winner of the so-called Maker-Breaker game on a given set system, even when every set has size at most 11. Since then, there has been no improvement on this result. We prove that the game remains PSPACE-complete even when every set has size 6.
BibTeX - Entry
@InProceedings{rahman_et_al:LIPIcs.STACS.2021.57,
author = {Rahman, Md Lutfar and Watson, Thomas},
title = {{6-Uniform Maker-Breaker Game Is PSPACE-Complete}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13702},
URN = {urn:nbn:de:0030-drops-137020},
doi = {10.4230/LIPIcs.STACS.2021.57},
annote = {Keywords: Game, Maker-Breaker, Complexity, Reduction, PSPACE-complete, NL-hard}
}
| Keywords: | Game, Maker-Breaker, Complexity, Reduction, PSPACE-complete, NL-hard | |
| Seminar: | 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 10.03.2021 |
