Improved simulation of nondeterministic Turing machines

Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configurations of the NTM. All methods in the literature have required time linear in the size

• Type: Journal
• Year: 2012
• Where: TCS
• Authors: Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh
• Keywords: Nondeterministic Turing Machine, Simulation Method, TCS 2012, Theoretical Computer Science, Time Dependence