Lower Bounds for Constant Depth Circuits for Prefix Problems
暂无分享,去创建一个
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] R. McNaughton,et al. Counter-Free Automata , 1971 .
[3] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.
[4] Leslie M. Goldschlager,et al. A unified approach to models of synchronous parallel machines , 1978, STOC.
[5] Z. Galil,et al. Explicit constructions of linear size superconcentrators , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[6] Uzi Vishkin,et al. Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.
[7] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[8] Stephen A. Cook,et al. Bounds on the time for parallel RAM's to compute simple functions , 1982, STOC '82.
[9] Uzi Vishkin,et al. A complexity theory for unbounded fan-in parallelism , 1982, FOCS 1982.
[10] Uzi Vishkin,et al. Implementation of Simultaneous Memory Address Access in Models That Forbid It , 1983, J. Algorithms.
[11] Richard J. Lipton,et al. Unbounded fan-in circuits and associative functions , 1983, J. Comput. Syst. Sci..
[12] Avi Wigderson,et al. Superconcentrators, generalizers and generalized connectors with limited depth , 1983, STOC.