Unbounded fan-in circuits and associative functions
暂无分享,去创建一个
[1] Avi Wigderson,et al. Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.
[2] F. Fich. Two problems in concrete complexity: cycle detection and parallel prefix computation , 1982 .
[3] Franz W. Peren. Arithmetic , 1903, Nature.
[4] Robert McNaughton,et al. Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .
[5] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] Uzi Vishkin,et al. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.
[7] R. McNaughton,et al. Counter-Free Automata , 1971 .
[8] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] Stephen A. Cook,et al. Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.
[10] Zvi Galil,et al. Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[11] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.