Physical Parallel Devices are not Much Faster than Sequential Ones

Abstract It is proven that any (uniform) family of physical parallel devices, recognizing a language C with time-complixity TP(n), can be simulated by a (uniform) family of sequential devices with time-complexity T P (n) 1 d (d is a constant, depending on the technology, but not greater than 13).

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

[2]  F. Leighton.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

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