Parallel and nondeterministic time complexity classes
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.
KeywordsTuring Machine Recursive Call Parameter List Call Instruction Active Processor
Unable to display preview. Download preview PDF.
- Chandra, A.K. and Stockmeyer, L.J., "Alternation," Proc. of the 17th Annual IEEE Symp. on Switching and Automata Theory, Houston, Texas, October 1976, 98–108.Google Scholar
- Cook, S.A., and Reckhow, R.A., "Time bounded random access machines," JCSS 7 (1973), 354–375.Google Scholar
- Hartmanis, J., and Simon, J., "On the power of multiplication in random access machines," Proc. of the 15th Annual IEEE Symp. on Switching and Automata Theory, New Orleans, October 1974, 13–23.Google Scholar
- Hopcroft, J.E., and Ullman, J.D., Formal Languages and Their Relation to Automata, Addition-Wesley, Reading, MA, 1969.Google Scholar
- Kozen, D., "On parallelism in Turing machines," Proc. of the 17th Annual IEEE Symp. on Switching and Automata Theory, Houston, Texas, October 1976, 89–97.Google Scholar
- Pratt, V.R. and Stockmeyer, L.J., "A characterization of the power of vector machines," JCSS 12 (1976), 198–221.Google Scholar
- Savitch, W.J. and Stimson, M.J., "Time bounded random access machines with parallel processing," JACM, (to appear).Google Scholar