Parallel and Nondeterministic Time Complexity Classes (Preliminary Report)

A random access machine model that has parallel processing and string manipulation is introduced. It is shown that NP is equal to the class of sets accepted by this model in nondeterministic time 0(log n), and this result is generalized to arbitrary time classes. A well-behaved subclass of the class of parallel, nondeter-ministic programs is analyzed.

[1]  H R Huessy,et al.  Time and space. , 1978, The American journal of psychiatry.

[2]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[3]  J. P. Linderman.  PRODUCTIVITY IN PARALLEL COMPUTATION SCHEMATA , 1973 .

[4]  Larry J. Stockmeyer,et al.  A characterization of the power of vector machines , 1974, STOC '74.

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

[6]  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 .

[7]  Joel H. Spencer,et al.  Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..

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

[9]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

[10]  M. Fischer,et al.  AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION , 1974 .

[11]  Amitava Bagchi.  Economy of Descriptions and Minimal Indices. , 1972 .

[12]  John A. Lind,et al.  A characterization of log-space computable functions , 1973, SIGA.

[13]  Albert R. Meyer,et al.  PROPERTIES OF BOUNDS ON COMPUTATION , 1969 .

[14]  S. R. Radev.  Programming languages and logics of programs , 1980, Logic of Programs.

[15]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[16]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[17]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[18]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[19]  Juris Hartmanis,et al.  On the Power of Multiplication in Random Access Machines , 1974, SWAT.

[20]  Albert R. Meyer,et al.  Definability in Dynamic Logic , 1980, STOC '80.

[21]  Albert R. Meyer,et al.  Honest bounds for complexity classes of recursive functions , 1972, Journal of Symbolic Logic.

[22]  Albert R. Meyer,et al.  On time-space classes and their relation to the theory of real addition , 1978, STOC '78.

[23]  Albert R. Meyer,et al.  Program size and economy of descriptions: Preliminary Report , 1972, STOC '72.

[24]  Walter J. Savitch,et al.  Time Bounded Random Access Machines with Parallel Processing , 1979, JACM.

[25]  J. Seiferas.  NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES , 1974 .

[26]  Albert R. Meyer.  The inherent computational complexity of theories of ordered sets , 1974 .

[27]  Albert R. Meyer,et al.  Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.

[28]  Michael J. Fischer,et al.  Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[29]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

[30]  M. Fischer,et al.  A note on independence of a regularity-preserving operator , 1970, SIGA.

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

[32]  Robert Moll.  Complexity Classes of Recursive Functions , 1973 .

[33]  Dennis M. Ritchie,et al.  A Classification of the Recursive Functions , 1972 .

[34]  P. Bloniarz.  THE COMPLEXITY OF MONOTONE BOOLEAN FUNCTIONS AND AN ALGORITHM FOR FINDING SHORTEST PATHS ON A GRAPH , 1980 .

[35]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[36]  Albert R. Meyer.  Program Size in Restricted Programming Languages , 1972, Inf. Control..

[37]  Albert R. Meyer,et al.  On orders of translations and enumerations. , 1973 .

[38]  Albert R. Meyer,et al.  Computability and completeness in logics of programs (Preliminary Report) , 1977, STOC '77.

[39]  D. Harel.  LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER , 1978 .

[40]  Michael J. Fischer,et al.  A Note on the Average Time to Compute Transitive Closures , 1976, ICALP.

[41]  Patrick C. Fischer,et al.  Computational speed-up by effective operators , 1972, Journal of Symbolic Logic.