Did the Train Reach its Destination: The Complexity of Finding a Witness.
Information Processing Letters（2017）
摘要
•Dohrau et al. studied a decision problem on switch graphs called ‘Arrival’.•We studied the search version of the Arrival problem, called ‘S-Arrival’.•We showed that S-Arrival is in the class PLS.
更多查看译文
关键词
Switch graphs,PLS,Cellular automaton,Combinatorial problems
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要