论文信息 - A hierarchy for nondeterministic time complexity

A hierarchy for nondeterministic time complexity

The purpose of this paper is to prove the following result: Theorem 1 For any real numbers r1, r2, 1 ≤ r1 < r2, there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterministic time complexity nr1 The computing devices are non-deterministic multitape Turing machines.

Stephen A. Cook | S. Cook

[1] Patrick C. Fischer,et al. Translational methods and computational complexity , 1965, SWCT.

[2] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[3] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[4] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[5] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[6] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[7] Oscar H. Ibarra. A Note Concerning Nondeterministic Tape Complexities , 1972, JACM.