Did the Train Reach its Destination: The Complexity of Finding a Witness
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.