Did the Train Reach its Destination: The Complexity of Finding a Witness
Computational Complexity
2017-01-09 v2 Computer Science and Game Theory
Abstract
Recently, Dohrau et al. studied a zero-player game on switch graphs and proved that deciding the termination of the game is in NP coNP. In this short paper, we show that the search version of this game on switch graphs, i.e., the task of finding a witness of termination (or of non-termination) is in PLS.
Keywords
Cite
@article{arxiv.1609.03840,
title = {Did the Train Reach its Destination: The Complexity of Finding a Witness},
author = {Karthik C. S.},
journal= {arXiv preprint arXiv:1609.03840},
year = {2017}
}