On Nondeterminism in Parallel Computation

Abstract Nondeterministic parallel complexity classes are investigated using two different nondeterministic versions of the hardware modification machine model. Differences in the effects of adding nondeterminism to parallel machines can be traced to the amount of nondeterminism available at each time step. Nondeterministic complexity classes defined by simultaneous bounds on both hardware and parallel time are also examined.

[1]  Jia-Wei Hong.  On Similarity and Duality of Computation (I) , 1984, Inf. Control..

[2]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

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

[4]  Leslie M. Goldschlager,et al.  A unified approach to models of synchronous parallel machines , 1978, STOC.

[5]  Hong Jai-Wei,et al.  On similarity and duality of computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  Patrick William Dymond.  Simultaneous resource bounds and parallel computation , 1980 .

[7]  James Christopher Wyllie,et al.  The Complexity of Parallel Computations , 1979 .

[8]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[9]  Stephen A. Cook,et al.  Hardware complexity and parallel computation , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Ivan Hal Sudborough,et al.  Efficient algorithms for path system problems and applications to alternating and time-space complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[13]  Patrick W. Dymond,et al.  Speedups of deterministic machines by synchronous parallel machines , 1983, J. Comput. Syst. Sci..

[14]  A. D. Palù,et al.  Universita' Degli Studi Di Verona Facolta' Di Scienze Mm Ff E Nn Tesi Di Laurea New Optimal Algorithms on Pointer Machines , 2004 .

[15]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[16]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[17]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[18]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[19]  Patrick W. Dymond,et al.  Speedups of Deterministic Machines by Synchronous Parallel Machines , 1985, J. Comput. Syst. Sci..

[20]  Ian Parberry.  A complexity theory of parallel computation , 1984 .