## References

SHOWING 1-10 OF 12 REFERENCES

### Nondeterministic One-Tape Off-Line Turing Machines and Their Time Complexity

- Computer ScienceJ. Autom. Lang. Comb.
- 2009

This paper shows that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n log n, and proves that under this measure, each accepting computation should exhibit a crossing sequence of length at least log log n.

### On the structure of one-tape nondeterministic turing machine time hierarchy

- Computer ScienceTheor. Comput. Sci.
- 1985

### Theory of One Tape Linear Time Turing Machines

- Computer ScienceSOFSEM
- 2004

This paper discusses the computational complexity of one-tape Turing machines of various machine types that halt in time O(n), where the running time of a machine is defined as the height of its computation tree.

### Computational Complexity of One-Tape Turing Machine Computations

- Computer ScienceJACM
- 1968

It is shown, among other things, that it is recursively undecidable how much time is required to recognize a nonregular context-free language on a one-tape Turing machine.

### Separating Nondeterministic Time Complexity Classes

- Computer ScienceJACM
- 1978

The strongest known dmgonalization results for both deterministic and nondetermlmstlc time complexity classes are reviewed and orgamzed for comparison with the results of the new padding technique.

### Computational Complexity: A Modern Approach

- Education
- 2009

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.

### Some combinatorial game problems require Ω(nk) time

- Mathematics, Computer ScienceJACM
- 1984

Dans cet article, on considere quelques problemes combinatoires et on etablit des problemes «naturels» dans P, pour la reconnaissance dont les limites inferieures en temps polynomial peuvent etre…

### PRIMES is in P

- Mathematics
- 2004

We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.