Lower bounds for constant depth circuits for prefix problems
- 26 December 2005
- book chapter
- Published by Springer Nature
- p. 109-117
- https://doi.org/10.1007/bfb0036901
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Unbounded fan-in circuits and associative functionsPublished by Association for Computing Machinery (ACM) ,1983
- Superconcentrators, generalizers and generalized connectors with limited depthPublished by Association for Computing Machinery (ACM) ,1983
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Bounds on the time for parallel RAM's to compute simple functionsPublished by Association for Computing Machinery (ACM) ,1982
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Explicit constructions of linear size superconcentratorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A unified approach to models of synchronous parallel machinesPublished by Association for Computing Machinery (ACM) ,1978
- On non-linear lower bounds in computational complexityPublished by Association for Computing Machinery (ACM) ,1975