Separating Nondeterministic Time Complexity Classes

AaSTancr. A recurslve padding technique is used to obtain conditions sufficient for separation of nondetermlmsttc multltape Turlng machine time complexity classes If T2 is a running time and Tl(n + 1) grows more slowly than T~(n), then there is a language which can be accepted nondetermmlstlcally within time bound T~ but which cannot be accepted nondetermlnlStlcally within time bound T1. If even T~(n + f(n)) grows more slowly than Tz(n), where f is the very slowly growing "rounded reverse" of some real-time countable function, then there is such a language over a single-letter alphabet. 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

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

[2]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[3]  Wolfgang J. Paul,et al.  On time hierarchies , 1977, STOC '77.

[4]  Hisao Yamada,et al.  Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..

[5]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[6]  Joel I. Seiferas,et al.  Relating Refined Space Complexity Classes , 1977, J. Comput. Syst. Sci..

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

[8]  J FischerMichael,et al.  Separating Nondeterministic Time Complexity Classes , 1978 .

[9]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[10]  Robert L. Constable,et al.  The Operator Gap , 1969, JACM.

[11]  Sheila A. Greibach,et al.  Time- and Tape-Bounded Turing Acceptors and AFLs , 1970, J. Comput. Syst. Sci..

[12]  Seymour Ginsburg,et al.  On AFL Generators for Finitely Encoded AFA , 1973, J. Comput. Syst. Sci..

[13]  Manuel Blum,et al.  On Almost Everywhere Complex Recursive Functions , 1974, JACM.

[14]  Herbert Fleischner,et al.  On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility , 1977, J. Comput. Syst. Sci..

[15]  N. A. Lynch.  RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY , 1972 .

[16]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[17]  Joel I. Seiferas.  Techniques for Separating Space Complexity Classes , 1977, J. Comput. Syst. Sci..

[18]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[19]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

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

[21]  Harry B. Hunt,et al.  The Equivalence Problem for Regular Expressions with Intersection is Not Polynomial in Tape , 1973 .

[22]  A. R. Meyer,et al.  COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1]. , 1971 .

[23]  P. Young,et al.  Easy constructions in complexity theory: Gap and speed-up theorems , 1973 .

[24]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[25]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[26]  Arnold L. Rosenberg,et al.  Real-Time Simulation of Multihead Tape Units , 1972, JACM.