The Parallel Complexity of Exponentiating Polynomials over Finite Fields

Faith E. Fich, Martin Tompa. The Parallel Complexity of Exponentiating Polynomials over Finite Fields. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, 6-8 May 1985, Providence, Rhode Island, USA. pages 38-47, ACM, 1985.

@inproceedings{FichT85,
  title = {The Parallel Complexity of Exponentiating Polynomials over Finite Fields},
  author = {Faith E. Fich and Martin Tompa},
  year = {1985},
  tags = {e-science},
  researchr = {https://researchr.org/publication/FichT85},
  cites = {0},
  citedby = {0},
  pages = {38-47},
  booktitle = {Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, 6-8 May 1985, Providence, Rhode Island, USA},
  publisher = {ACM},
}