Vikraman Arvind, S. Raja. The Complexity of Bounded Register and Skew Arithmetic Computation. In Zhipeng Cai, Alex Zelikovsky, Anu G. Bourgeois, editors, Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings. Volume 8591 of Lecture Notes in Computer Science, pages 572-583, Springer, 2014. [doi]
@inproceedings{ArvindR14-0,
title = {The Complexity of Bounded Register and Skew Arithmetic Computation},
author = {Vikraman Arvind and S. Raja},
year = {2014},
doi = {10.1007/978-3-319-08783-2_49},
url = {http://dx.doi.org/10.1007/978-3-319-08783-2_49},
researchr = {https://researchr.org/publication/ArvindR14-0},
cites = {0},
citedby = {0},
pages = {572-583},
booktitle = {Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
editor = {Zhipeng Cai and Alex Zelikovsky and Anu G. Bourgeois},
volume = {8591},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-08782-5},
}