论文信息 - Time Bounded Random Access Machines with Parallel Processing

Time Bounded Random Access Machines with Parallel Processing

The RAM model of Cook and Reckhow ~s extended to allow parallel recursive calls and the elementary theory of such machines is developed The uniform cost criterion is used The results include proofs of (!) the eqmvalence of nondetermmtsUc and determm~sttc polynomml Ume for such parallel machines and (2) the eqmvalence of polynomml tmae on such parallel machines and polynomml space on ordinary nonparallel RAM's Also included are results showing that parallelism appears to be stnctly more powerful than nondeter-

Walter J. Savitch | Michael J. Stimson | W. Savitch | M. J. Stimson

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

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

[3] Walter J. Savitch. Recursive turing machines , 1977 .

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

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

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

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

[8] Michael Joseph Stimson. The complexity of parallel algorithms. , 1976 .