Lower bounds for constant depth circuits for prefix problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 154 LNCS, Issue , 1983, Pages 109-117

  Chandra, Ashok K ^a   Fortune, Steven ^a   Lipton, Richard ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; TIMING CIRCUITS;

BIT NUMBERS; CIRCUIT SIZE; CONSTANT FACTORS; CONSTANT-DEPTH CIRCUITS; LOWER BOUNDS; UPPER BOUND;

RECURSIVE FUNCTIONS; LOGIC CIRCUITS;

CONSTANT DEPTH CIRCUITS; LOWER BOUNDS; PARALLEL COMPUTATION; PREFIX PROBLEMS; PREFIX-CARRY CIRCUITS;

EID: 0020984292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036901     Document Type: Conference Paper

References (13)

1. S. Cook and C. Dwork,“Bounds on the Time for Parallel RAM’s to Compute Simple Functions,” Proceedings of the 14th ACM Symposium on Theory of Computing, 1982, 231–233.
2. A.K. Chandra, S.J. Fortune, R. Lipton, “Unbounded Fanin Circuits and Associative Functions,” Proceedings of the 15th ACM Symposium on Theory of Computing, 1983.
3. A.K. Chandra, L.J. Stockmeyer, U. Vishkin, “A Complexity Theory for Unbounded Fan-in Parallelism,” Proceedings 23rd Annual Symposium on the Foundations of Computer Science, 1982, pp. 1–13.
4. D. Dolev, C. Dwork, N. Pippenger, A. Wigderson, “Superconcentrators, Generalizers and Generalized Connectors with Limited Depth,” Proceedings of the 15th ACM Symposium on Theory of Computing, 1983.
5. M. Furst, J. Saxe, M. Sipser, “Parity, Circuits, and the Polynomial-time Hierarchy,” Proceedings of the 22nd Annual Symposium on the Foundations of Computer Science, 1981, pp. 260–270.
6. O. Gabber and Z. Galil, “Explicit Constructions of Linear Size Concentrators,” Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, 1979, pp. 364–370.
7. L.M. Goldschlager, “A Unified Approach to Models of Synchronous Parallel Machines,” Proceedings of the Tenth ACM Symposium on Theory of Computing, 1978, pp. 89–94.
8. F. Harary, Graph Theory, Addison-Wesley Publishing Co ., Reading, Mass, 1971.
9. R. McNaughton, S. Papert, Counter-Free Automata, Research Monograph No. 65, The MIT Press, Cambridge, Mass ., 1971.
10. R. Reischuk, “A Lower Time Bound for Parallel Random Access Machines without Simultaneous Writes,” Report RJ3431, IBM Research Lab, San Jose, Ca, 1982.
11. Y. Shiloach and U. Vishkin, “Finding the Maximum, Merging, and Sorting in a Parallel Computation Model,” J. of Algorithms 2 (1981), pp. 88–102.
12. L.G. Valiant, “On Non-linear Lower Bounds in Computational Complexity,” Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, 1975, pp. 45–53.
13. U.Vishkin “Implementation of Simultaneous Memory Access in Models that Forbid it,” Tech Report No 210, Dept of Computer Science, Technion, Haifa, Israel, 1981.