The Complexity of Iterated Multiplication. Immerman, N. & Landau, S. Inf. Comput., 116(1):103-116, 01, 1995.
The Complexity of Iterated Multiplication [link]Link  The Complexity of Iterated Multiplication [link]Paper  bibtex   
@article{journals/iandc/ImmermanL95,
  added-at = {2015-11-20T00:00:00.000+0100},
  author = {Immerman, Neil and Landau, Susan},
  biburl = {https://www.bibsonomy.org/bibtex/2cdfda0891d7d3c21e0f2526fd12908c8/dblp},
  ee = {http://dx.doi.org/10.1006/inco.1995.1007},
  interhash = {6bf4d010d5880cd71b7b04c1b52ab432},
  intrahash = {cdfda0891d7d3c21e0f2526fd12908c8},
  journal = {Inf. Comput.},
  keywords = {dblp},
  month = {01},
  number = 1,
  pages = {103-116},
  timestamp = {2015-11-24T11:36:53.000+0100},
  title = {The Complexity of Iterated Multiplication},
  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc116.html#ImmermanL95},
  volume = 116,
  year = 1995
}

Downloads: 0