Sciweavers

STACS
1999
Springer
14 years 4 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...