Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan. Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. pages 13-27, IEEE Computer Society, 2005. [doi]
@inproceedings{ArvindKV05,
title = {Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy},
author = {Vikraman Arvind and Piyush P. Kurur and T. C. Vijayaraghavan},
year = {2005},
doi = {10.1109/CCC.2005.7},
url = {http://dx.doi.org/10.1109/CCC.2005.7},
tags = {graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/ArvindKV05},
cites = {0},
citedby = {0},
pages = {13-27},
booktitle = {20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA},
publisher = {IEEE Computer Society},
isbn = {0-7695-2364-1},
}