The Complexity of Iterated Multiplication. Immerman, N. & Landau, S. In Computational Complexity Conference, pages 104-111, 1989. IEEE Computer Society.
The Complexity of Iterated Multiplication. [link]Link  The Complexity of Iterated Multiplication. [link]Paper  bibtex   
@inproceedings{conf/coco/ImmermanL89,
  added-at = {2019-12-20T00:00:00.000+0100},
  author = {Immerman, Neil and Landau, Susan},
  biburl = {https://www.bibsonomy.org/bibtex/28b77ca5d9e50dadc1fdae3a3daaf467f/dblp},
  booktitle = {Computational Complexity Conference},
  crossref = {conf/coco/1989},
  ee = {http://doi.ieeecomputersociety.org/10.1109/SCT.1989.41816},
  interhash = {9e44aaaddee98a995f3eb56d1f46a3c1},
  intrahash = {8b77ca5d9e50dadc1fdae3a3daaf467f},
  isbn = {0-8186-1958-9},
  keywords = {dblp},
  pages = {104-111},
  publisher = {IEEE Computer Society},
  timestamp = {2019-12-21T11:40:16.000+0100},
  title = {The Complexity of Iterated Multiplication.},
  url = {http://dblp.uni-trier.de/db/conf/coco/coco89.html#ImmermanL89},
  year = 1989
}

Downloads: 0