Lower Bounds for Constant Depth Circuits for Prefix Problems

Ashok K. Chandra, Steven Fortune, Richard J. Lipton. Lower Bounds for Constant Depth Circuits for Prefix Problems. In Josep Díaz, editor, Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings. Volume 154 of Lecture Notes in Computer Science, pages 109-117, Springer, 1983.

@inproceedings{ChandraFL83,
  title = {Lower Bounds for Constant Depth Circuits for Prefix Problems},
  author = {Ashok K. Chandra and Steven Fortune and Richard J. Lipton},
  year = {1983},
  researchr = {https://researchr.org/publication/ChandraFL83},
  cites = {0},
  citedby = {0},
  pages = {109-117},
  booktitle = {Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings},
  editor = {Josep Díaz},
  volume = {154},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-12317-2},
}