An arithmetic for non-size-increasing polynomial-time computation

Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg. An arithmetic for non-size-increasing polynomial-time computation. Theoretical Computer Science, 318(1-2):3-27, 2004. [doi]

@article{AehligBHS04,
  title = {An arithmetic for non-size-increasing polynomial-time computation},
  author = {Klaus Aehlig and Ulrich Berger and Martin Hofmann and Helmut Schwichtenberg},
  year = {2004},
  doi = {10.1016/j.tcs.2003.10.023},
  url = {http://dx.doi.org/10.1016/j.tcs.2003.10.023},
  researchr = {https://researchr.org/publication/AehligBHS04},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {318},
  number = {1-2},
  pages = {3-27},
}