Subruk's Site
Subruk's Site
Home
Publications
Students
Teaching
Contact
Light
Dark
Automatic
Simulation
Improved Simulation of Nondeterministic Turing Machines
The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large bounded-degree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the …
Cite
×