@InProceedings{rahman_et_al:LIPIcs.ISAAC.2018.9,
author = {Rahman, Md Lutfar and Watson, Thomas},
title = {{Complexity of Unordered CNF Games}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {9:1--9:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.9},
URN = {urn:nbn:de:0030-drops-99574},
doi = {10.4230/LIPIcs.ISAAC.2018.9},
annote = {Keywords: CNF, Games, PSPACE-complete, SAT, Linear Time}
}